Many kinds of reorder point reorder quantity policies with an emergency order, in which we can decide when the expedited order point is reached and then we place an expedited replenishment order, have been presented in earlier contributions. Very few studies on cyclic inventory control with an emergency order, however, have been reported. The purpose of this paper is to establish some analytica...

This paper studies supply chain demand variability in a model with one supplier and N retailers that face stochastic demand. Retailers implement scheduled ordering policies: Orders occur at fixed intervals and are equal to some multiple of a fixed batch size. A method is presented that exactly evaluates costs. Previous research demonstrates that the supplier’s demand variance declines as the re...

We consider the joint pricing and inventory control problem for a single product with a finite horizon and periodic review. The demand distribution in each period is determined by an exogenous Markov chain. Pricing and ordering decisions are made at the beginning of each period and all shortages are backlogged. The surplus costs as well as fixed and variable costs are state dependent. We show t...

In most multi-item inventory systems, the ordering costs consist of a major cost and a minor cost for each item included. Applying for every individual item a cyclic inventory policy, where the cycle length is a multiple of some basic cycle time, reduces the major ordering costs. An e cient algorithm to determine the optimal policy of this type is discussed in this paper. It is shown that this ...

Little attention is given in the literature to decisions on the appropriate selection of suppliers, and on assigning order quantities to these suppliers, in the case of multiple sourcing, with multiple criteria and with suppliers' capacity constraints. Only a few mathematical programming models to analyse such decisions have been published to date, and these have tended to consider only net pri...

A problem of survivable layout of an IP network topology on a wavelength division multiplexed network is considered. Simple layout algorithms are given that have low time complexities. The algorithms are variations of a basic algorithm, that lays out IP links as lightpaths sequentially according to some order and with respect to link costs. Simulations show that the ordering and link costs can ...

  Background: Increased costs and mortality associated with inappropriate blood transfusions have led to investigations about blood request and blood transfusion techniques. We investigated the transfusion status in patients who underwent orthopedic surgery in Poursina Hospital (Rasht, Iran) to optimizing blood usage and determine if a scheduled transfusion program for every orthopedic surgery ...

The joint replenishment of inventory problem (JRP) requires independence of minor ordering costs. In this paper we propose an evolutionary algorithm (EA) for a modification of the JRP. The modified JRP allows for interdependence of minor ordering costs. Our proposed EA (EARP) is a nested EA that searches for a solution to minimize the total cost of inventory replenishment. It combines an EA whi...

In most multi-item inventory systems, the ordering costs consist of a major cost and a minor cost for each item included. Applying for every individual item a cyclic inventory policy, where the cycle length is a multiple of some basic cycle time, reduces the major ordering costs. An e cient algorithm to determine the optimal policy of this type is discussed in this paper. It is shown that this ...

We consider the following two deterministic inventory optimization problems over a finite planning horizon T with non-stationary demands. • Submodular Joint Replenishment Problem. This involves multiple item types and a single retailer who faces demands. In each time step, any subset of item-types can be ordered incurring a joint ordering cost which is submodular. Moreover, items can be held in...