Sharif Digital Repository

In this paper, the truly Meshless Local Petrov-Galerkin (MLPG) method is extended for computation of steady incompressible flows, governed by the Navier-Stokes equations (NSE), in vorticity-stream function formulation. The present method is a truly meshless method based on only a number of randomly located nodes. The formulation is based on two equations including stream function Poisson equation and vorticity advection-dispersion-reaction equation (ADRE). The meshless method is based on a local weighted residual method with the Heaviside step function and quartic spline as the test functions respectively over a local subdomain. Radial basis functions (RBF) interpolation is employed in shape... 

In this paper, the truly Meshless Local Petrov-Galerkin (MLPG) method is extended for computation of unsteady incompressible flows, governed by the Navier-Stokes equations (NSE), in vorticity-stream function formulation. The present method is a truly meshless method based only on a number of randomly located nodes. The formulation is based on two equations including stream function Poisson equation and vorticity advection-dispersion-reaction eq. (ADRE). The meshless method is based on a local weighted residual method with the Heaviside step function and quartic spline as the test functions respectively over a local subdomain. Moving Least Square approximation (MLS) is employed in shape... 

Free surface flows are frequently encountered in hydraulic engineering problems including water jets, weirs and around gates. An iterative solution to the incompressible two-dimensional vertical steady Navier-Stokes equations, comprising momentum and continuity equations, is used to solve for the priori unknown free surface, the velocity and the pressure fields. The entire water body is covered by a unstructured finite element grid which is locally refined. The dynamic boundary condition is imposed for the free surface where the pressure vanishes. This procedure is done continuously until the normal velocities components vanish. To overcome numerical errors and oscillations encountering in... 

This paper deals with the solution of two-dimensional fluid flow problems using the truly meshless Local Petrov-Galerkin (MLPG) method. The present method is a truly meshless method based only on a number of randomly located nodes. Radial basis functions (RBF) are employed for constructing trial functions in the local weighted meshless local Petrov-Galerkin method for two-dimensional transient viscous fluid flow problems. No boundary integration is needed, no element matrix assembly is required and no special treatment is needed to impose the essential boundary conditions due to satisfaction of kronecker delta property in RBFs. Three different radial basis functions (RBFs), i.e.... 

In this article, we design a revenue-sharing contract to coordinate inventory control decisions in a serial supply chain consisting of one supplier, one vendor, and one retailer. We assume that the retailer faces Poisson demand and his unsatisfied demands will be lost. The retailer applies one-for-one period policy in which he constantly places an order for one unit of product to the vendor in a predetermined time interval which results in a deterministic demand for the vendor. Vendor orders the required quantity from supplier which will be immediately received at the vendor’s warehouse. Solution procedures are developed to find the equilibrium in the vendor managed inventory program with a... 

In this paper, we design a revenue sharing contract to coordinate pricing and inventory control decisions in a serial supply chain consisting of one supplier, one manufacturer and one retailer. We assume that the retailer faces Poisson demand and his unsatisfied demands will be lost. The retailer applies one-for-one period policy in which he constantly places an order for one unit of product to the manufacturer in a predetermined time interval which results in a deterministic demand for the manufacturer. Solution procedures are developed to find the equilibrium in the Vendor Managed Inventory (VMI) program with a revenue sharing contract, in which no party is willing to deviate from for the... 

The purpose of this paper is to adopt and analyze a new ordering policycalled one-for-one-period policy in a multi-echelon supply chain consisting ofone retailer and a series of TV suppliers. The main advantage of adopting theone-for-one-period (7,7) ordering policy for retailers is the elimination ofuncertainty for supplier which leads to total elimination of the safety stocksat all suppliers. This in turn leads to the reduction of the total system costsand in case any supplier's ordering cost is negligible it can even eliminate theneed for him to carry any inventory. In addition to this advantage, thenumerical results show that the application of this new policy for the retailerleads to... 

In this paper we introduce a new ordering policy for inventory control in a two-echelon inventory system consisting of one central warehouse and a number of non-identical retailers. The warehouse uses a modified one-for-one policy, but the retailers apply a new policy which is different from the traditional inventory policies described in the literature of inventory and production control systems. In this system, each retailer constantly places an order for one unit of product to the central warehouse in a pre-determined time interval; i.e., the time interval between any two consecutive orders from each retailer is a fixed number and the quantity of each order is one. We then show how the... 

This paper is focused on the representation and treatment of knowledge and data uncertainty within the context of an important industrial challenge, i.e., new product pricing. The most well known participating factor in pricing process is cost meanwhile the other factors like customer value and firm's strategy should be considered in the pricing process, as well. Besides, there are other important factors like the risks that consumer bear in purchasing new product which must be carefully analyzed and considered. Nonetheless, many of these factors are blended with uncertainty. In recent decades, fuzzy logic was well developed and implemented in many applications to treat vagueness in... 

We consider a dyadic supply chain. Retailer applies (R,Q)-policy. Supplier starts with m initial batches of size Q and places an order of the same size to an outside source. The supplier can select one of the two following cases. Case 1, whenever the retailer places an order, the supplier will also place an order. Case 2, whenever the retailer's inventory position reaches R+s, the supplier will place an order. This paper derives the cost differential between these cases for any value of s, which enables the supply chain managers to decide whether to install an information sharing technology  

In this paper we consider a newsvendor problem in which the suppliers offer quantity discounts. We assume that the initial inventory at the beginning of the period is a random variable. This assumption, among other applications, may apply to the case where the decision about the order quantity must be made at a time long before the start of the period and the available inventory may decrease due to several factors, such as deterioration, consumption, etc. up to the start of the period. In this paper, we obtain the optimal order quantity that maximizes the total profit for this model  

This paper considers an imperfect production system in which defective items are produced in. each cycle of production. We assume that the defectives produced within each cycle will be reworked immediately after each production run is completed. We also assume some scrap is produced and detected during the rework period. Further, we assume that the number of scrapped items produced during the rework period is a random variable. For this system, using some theorem from the renewal theory, the expected total cost function per unit time is derived and the optimal batch quantity is obtained  

This paper attempts to develop the optimal solution for an inventoryproblem consisting of a single machine which produces items some of which may bedefective. We assume that no shortages are allowed and all defective items areto be reworked. Setup cost for rework and waiting time of defectives areconsidered. We consider two different policies where in the first policy in eachcycle after the regular production the machine is setup for the rework ofdefectives of the same cycle. In the second policy several cycles constitute aperiod. All the defectives produced in the period are reworked in the last cycleof that period. At the end of the rework cycle the whole process starts allover again. One... 

This paper deals with a two-echelon inventory system consisting of onesupplier and N retailers. Each retailer faces an independent Poisson demand withthe same rate and applies a new ordering policy called one-for-one- periodordering policy for its inventory control. In this ordering policy the ordersize is equal to one and the time interval between any two consecutive ordersforms a common fixed cycle. Thus, the supplier faces a deterministic demand andadopts a deterministic inventory policy. At each cycle he orders a batch of sizeN to his own supplier. Upon receipt of each batch he sends 1 unit of theproduct to each retailer with a transportation cost. In this paper, for theabove system we... 

In this paper, we develop an inventory model with price dependant demand rate, under time value of money and inflation, finite time horizon, exponential backlogging rate and exponential deterioration rate with the objective of maximizing the present worth of the total system profit. Using a dynamic programming based solution algorithm, we are able to find the optimal sequence of the cycles and also to obtain different optimal selling prices and optimal order quantities for the cycles with unequal lengths, which have never been done before for our model. We also use a proper numerical example to show accuracy of the solution procedure. © 2008 IEEE  

This paper deals with the issue of economic batch quantity (EBQ) in a single machine system in which defective items are produced in each cycle of production. The accumulated defective items produced in a period, consisting of several equal cycles, are all reworked in the last cycle of this period called the rework cycle. At the end of each period the whole process will start all over again. We assume that there is a limitation on the total defective items. We also do not adopt the restriction that the rework process rate be equal to the normal production rate. In addition we assume that there is a set up time for rework process. Further we assume that the number of rework cycles be as small... 

This paper deals with the issue of economic batch quantity (EBQ) in a single machine system in which defective items are produced in each cycle of production. The defective items produced in the first N cycles are accumulated at the end of the Nth cycle and are all reworked in a separate cycle called the rework cycle which has the same length as the other cycles and begins just at the end of the Nth cycle. At the end of the rework cycle the whole process will start all over again. For this system, assuming no shortages are permitted we obtain the economic batch quantity which minimizes the total cost