The stochastic dynamic production/inventory lot-sizing problem with service-level constraints

International Journal of Production Economics

Volumn 88, Issue 1, 2004, Pages 105-119

  Armagan Tarim, S ^a   Kingsman, Brian G ^b  

^a UNIVERSITY OF YORK   (United Kingdom)

^b LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

Chance constrained programming; Integer programming; Inventory; Modelling; Optimisation

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; COSTS; HEURISTIC METHODS; INTEGER PROGRAMMING; INVENTORY CONTROL; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES;

CHANCE-CONSTRAINED PROGRAMMING; INVENTORY;

PRODUCTION CONTROL;

EID: 0742266961     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(03)00182-8     Document Type: Article

References (23)

1. Askin R.G. A procedure for production lot-sizing with probabilistic dynamic demand. AIIE Transactions. 13:1981;132-137.
2. Berry W.L. Lot sizing procedures for requirements planning systems. A framework for analysis Production and Inventory Management Journal. 13:1972;19-34.
3. Birge J.R., Louveaux F. Introduction to Stochastic Programming. 1997;Springer, New York.
4. Bookbinder J.H., Tan J.Y. Strategies for the probabilistic lot-sizing problem with service level constraints. Management Science. 34:1988;1096-1108.
5. Chen F.Y., Krass D. Inventory models with minimal service level constraints. European Journal of Operational Research. 134:2001;120-140.
6. Davis T. Effective supply chain management. Sloan Management Review. 34:1993;35-46.
7. De Bodt M.A., Gelders L.F., Van Wassenhove L.N. Lot-sizing under dynamic demand conditions. A review Engineering Costs and Production Economics. 8:1984;165-187.
8. Gavirneni S., Tayur S. An efficient procedure for non-stationary inventory control. IIE Transactions. 33:2001;83-89.
9. Iida T. The infinite horizon non-stationary stochastic inventory problem. Near myopic policies and weak ergodicity European Journal of Operational Research. 116:1999;405-422.
10. ILOG CPLEX 8.0, 2002. User's Manual, ILOG.
11. Karni R. Integer linear programming formulation of the material requirements planning problem. Journal of Optimization Theory and Applications. 35:1981;217-230.
12. Kimms A. Multi-Level Lot-Sizing and Scheduling Methods for Capacitated Dynamic and Deterministic Models. Physica Verlag Series on Production and Logistics. 1997;Springer, Berlin.
13. Kuik R., Salomon M., Van Wassenhove L.N. Batching decisions. Structure and models European Journal of Operational Research. 75:1994;243-263.
14. Martel A., Diaby M., Boctor F. Multiple items procurement under stochastic nonstationary demands. European Journal of Operational Research. 87:1995;74-92.
15. Potts C.N., Van Wassenhove L.N. Integrating scheduling with batching and lot-sizing. A review of algorithms and complexity Journal of the Operational Research Society. 43:1992;395-406.
16. Rosling, K., 1999. The square-root algorithm for single-item inventory optimization. Working Paper, Lund University.
17. Silver E.A. Inventory control under a probabilistic time-varying demand pattern. AIIE Transactions. 10:1978;371-379.
18. Sobel M.J., Zhang R.Q. Inventory policies for systems with stochastic and deterministic demand. Operations Research. 49:2001;157-162.
19. Sox C.A. Dynamic lot-sizing with random demand and non-stationary costs. Operations Research Letters. 20:1997;155-164.
20. Van Houtum G.J., Zijm W.H.M. On the relation between cost and service models for general inventory systems. Statistica Neerlandica. 54:2000;127-147.
21. Wagner H.M., Whitin T.M. Dynamic version of the economic lot size model. Management Science. 5:1958;89-96.
22. Wemmerlov U. The behaviour of lot-sizing procedures in the presence of forecast errors. Journal of Operations Management. 8:1989;37-47.
23. Zangwill W.I. Minimum concave cost flows in certain networks. Management Science. 14:1968;429-450.