Production planning with limited inventory capacity and allowed stockout

International Journal of Production Economics

Volumn 111, Issue 1, 2008, Pages 180-191

  Liu, X ^a,b   Tu, Yl ^b  

^a NORTHEASTERN UNIVERSITY   (China)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

Algorithm; Bounded inventory; Production planning; Stockout

Indexed keywords

ALGORITHMS; INVENTORY CONTROL; PROBLEM SOLVING; STRATEGIC PLANNING;

BOUNDED INVENTORY; PRODUCTION PLANNING; STOCKOUT;

PRODUCTION ENGINEERING;

EID: 36148961900     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2007.01.010     Document Type: Article

References (24)

1. Aggarwal A., and Park J.K. Improved algorithms for economic lot-size problems. Operations Research 41 3 (1993) 549-571
2. Aksen D., Altinkemer K., and Chand S. The single-item lot sizing production with immediate lost sales. European Journal of Operational Research 147 (2003) 558-566
3. Baker K.B., Dixon P., Magazine M.J., and Silver E.A. An algorithm for the dynamic lot-size problem with time-varying production capacity constraints. Management Science 24 16 (1978) 1710-1720
4. Bitran G.R., and Yanasse H.H. Computational complexity of the capaciated lot size problem. Management Science 28 10 (1982) 1174-1186
5. Chen H.D., Hearn D.W., and Lee C.Y. A new dynamic programming algorithm for the single item capacitated dynamic lot size model. Journal of Global Optimization 4 (1994) 285-300
6. Chung C.S., Flynn J., and Lin C.H.M. An effective algorithm for the capacitated single item lot size problem. European Journal of Operational Research 75 (1994) 427-440
7. Federgruen A., and Tzur M. A single forward algorithm to solve general dynamic lot sizing models with n periods in O(n log n) or O(n) time. Management Science 37 (1991) 909-925
8. Florian M., and Klein M. Deterministic production planning with concave costs and capacity constraints. Management Science 18 1 (1971) 12-20
9. Florian M., Lenstra J.K., and Rinnooy Kan A.H.G. Deterministic production planning: algorithm and complexity. Management Science 26 7 (1980) 669-679
10. Gutierrez J., Sedeno-Noda A., Colebrook M., and Sicilia J. A new characterization for the dynamic lot size problem with bounded inventory. Computers & Operation Research 30 (2002) 383-395
11. Gutierrez, J., Sedeno-Noda, A., Colebrook, M., Sicilia, J., 2005. A polynomial algorithm for the production/ordering planning problem with limited storage. Computers & Operation Research; available online 〈http://www.Sciencedirect.com〉.
12. Kirca O. An efficient algorithm for the capacitated single item dynamic lot size problem. European Journal of Operational Research 45 (1990) 15-24
13. Liu, X., 2004. Models and algorithms for capacitated lot sizing problems. Ph.D. Thesis. Université de Technologie de Troyes, France.
14. Liu, X., Wang, C., Chu, F., Chu, C., 2004. A forward algorithm for capacitated lot-sizing problem with lost sales. In: Proceeding of the IEEE Fifth World Congress on Intelligent Control and Automation, 15-19 June, China, vol. 4, pp. 3192-3196.
15. Love S.F. Bounded production and inventory models with piecewise concave costs. Management Science 20 3 (1973) 313-318
16. Sandbothe R.A., and Thompson G.L. A forward algorithm for the capacitated lot size model with stockouts. Operations Research 38 3 (1990) 474-486
17. Sandbothe R.A., and Thompson G.L. Decision horizons for the capacitated lot size model with inventory bounds and stockouts. Computers & Operations Research 20 5 (1993) 455-465
18. Shaw D.X., and Wagelmans A.P.M. An algorithm for single item capacitated economic lot-sizing with piecewise linear production costs and general holding costs. Management Science 44 (1998) 831-838
19. Swoveland C.A. Deterministic multi-period production planning model with piecewise concave production and holding-backorder costs. Management Science 21 9 (1975) 1007-1013
20. 3) algorithm for the economic lot-sizing problem with constant capacities. Management Science 42 (1996) 142-150
21. Wagelmans A., Van Hoesel S., and Kolen A. Economic lot-sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case. Operations Research 40 (1992) 145-156
22. Wagner H.M., and Whitin T. Dynamic version of the economic lot size model. Management Science 5 (1958) 89-96
23. Zangwill W.I. Minimum concave cost flows in certain networks. Management Science 14 9 (1968) 429-450
24. Zangwill W.I. A backlogging model and a multi-echelon model of a dynamic economic lot size production system-a network approach. Management Science 15 9 (1969) 506-527