Can-order policies for coordinated inventory replenishment with Erlang distributed times between ordering

European Journal of Operational Research

Volumn 113, Issue 1, 1999, Pages 30-41

  Schultz, Helle ^a   Johansen, Søren Glud ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Coordinated replenishment; Inventory; Stochastic modelling

Indexed keywords

ALGORITHMS; COSTS; MATHEMATICAL MODELS; PURCHASING; RANDOM PROCESSES;

COORDINATED INVENTORY REPLENISHMENT; DECOMPOSITION ALGORITHMS; ERLANG-DISTRIBUTED TIMES;

INVENTORY CONTROL;

EID: 0033078589     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00431-1     Document Type: Article

References (7)

1. Atkins D.R., Iyogun P.O. Periodic versus can-order policies for coordinated multi-item inventory systems. Management Science. 34(6):1988;791-796.
2. Federgruen A., Schechner Z. Cost formulas for continuous review inventory models with fixed delivery lags. Operations Research. 31(5):1983;957-965.
3. Federgruen A., Groenevelt H., Tijms H.C. Coordinated replenishments in a multi-item inventory system with compound Poisson demands. Management Science. 30(3):1984;344-357.
4. Law, A.M., Kelton, W.D., 1991. Simulation Modelling and Analysis. McGraw-Hill, New York.
5. Pantumsinchai P. A comparison of three joint ordering inventory policies. Decision Sciences. 23:1992;111-127.
6. Tijms, H.C., 1994. Stochastic Modelling and Analysis. Wiley, Chichester, UK.
7. Zheng Y.S. Optimal control policy for stochastic inventory systems with Markovian discount opportunities. Operations Research. 42(4):1994;721-738.