The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs

Computers and Operations Research

Volumn 36, Issue 11, 2009, Pages 2926-2936

  Absi, Nabil ^a   Kedad Sidhoum, Safia ^b  

^a ECOLE DES MINES DE SAINT ETIENNE   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Dynamic programming; Lagrangian heuristic; Lot sizing; Safety stocks; Shortages

Indexed keywords

CAPACITATED LOT SIZINGS; DYNAMIC PROGRAMMING ALGORITHMS; LA-GRANGIAN RELAXATIONS; LAGRANGIAN HEURISTIC; LOT-SIZING; MULTI ITEMS; NP-HARD; RESOURCE CAPACITIES; SAFETY STOCKS; SET-UP TIME; SHORTAGES; SMOOTHING ALGORITHMS; SUB-PROBLEMS; UPPER BOUNDS;

DYNAMIC PROGRAMMING; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; SYSTEMS ENGINEERING;

HEURISTIC ALGORITHMS;

EID: 64549109311     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.01.007     Document Type: Article

References (27)

1. Chen W.H., and Thizy J.M. Analysis of relaxations for the multi-item capacitated lot-sizing problem. Annals of Operations Research 26 (1990) 29-72
2. Maes J., and Van Wassenhove L. Multi-item single-level capacitated dynamic lot-sizing heuristics: a general review. Journal of Operational Research Society 39 11 (1988) 991-1004
3. Dogramaci A., Panayiotopoulos J.C., and Adam N.R. The dynamic lot-sizing problem for multiple items under limited capacity. IIE Transactions 13 4 (1981) 294-303
4. Absi N., and Kedad-Sidhoum S. MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs. RAIRO-Operations Research 41 2 (2007) 171-192
5. Absi N., and Kedad-Sidhoum S. The multi-item capacitated lot-sizing problem with setup times and shortage costs. European Journal of Operational Research 185 3 (2008) 1351-1374
6. Aksen D., Altinkemer K., and Chand S. The single-item lot-sizing problem with immediate lost sales. European Journal of Operational Research 147 (2003) 558-566
7. Loparic M., Pochet Y., and Wolsey L.A. The uncapacitated lot-sizing problem with sales and safety stocks. Mathematical Programming 89 (2001) 487-504
8. Diaby M., Bahl H.C., Karwan M.H., and Zionts S. A Lagrangean relaxation approach for very large scale capacitated lot-sizing. Management Science 38 9 (1992) 1329-1340
9. Zangwill W.I. A deterministic multi-period production scheduling model with backlogging. Management Science 13 (1966) 105-119
10. 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
11. Hsu V.N., and Lowe T.J. Dynamic economic lot size models with period-pair-dependent backorder and inventory costs. Operations Research 49 (2001) 316-321
12. Graves S.C. Manufacturing planning and control. Handbook of applied optimization (2002), Oxford University Press, Oxford
13. Aksen D. Loss of customer goodwill in the uncapacitated lot-sizing problem. Computers & Operations Research 34 (2007) 2805-2823
14. Süral H., Denizel M., and Van Wassenhove L.N. Lagrangean relaxation based heuristics for lot-sizing with setup times. European Journal of Operational Research 194 1 (2009) 51-63
15. Krarup J., and Bilde O. Plant location, set covering and economic lot sizes: an O (mn)-algorithm for structured problems. In: Collatz L., et al. (Ed). Optimierung bei graphentheoretischen and ganzzähligen Problemen (1977), Birkhauser Verlag, Basel 155-180
16. Wagner H.M., and Whitin T.M. A dynamic version of the economic lot size model. Management Science 5 (1958) 89-96
17. Aggarwal A., and Park J.K. Improved algorithms for economic lot size problems. Operations Research 41 (1993) 549-571
18. Federgruen A., and Tzur M. A simple 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
19. Wagelmans A., Van Hoesel C.P.M., and Kolen A. Economic lot sizing: an o (n log n) that runs in linear time in the Wagner-Whitin case. Operations Research 40 (1992) S145-S156
20. Zangwill W.I. Minimum concave cost flows in certain networks. Management Science 14 (1968) 429-450
21. Orlin J.B. A faster strongly polynomial minimum cost flow algorithm. Operations Research 41 2 (1993) 338-350
22. Fisher M.L. The Lagrangian relaxation method for solving integer programming problems. Management Science 27 (1981) 1-18
23. Trigeiro W., Thomas L.J., and McLain J.O. Capacitated lot-sizing with setup times. Management Science 35 (1989) 353-366
24. Brahimi N., Dauzère-Pérès S., and Najid N.M. Capacitated multi-item lot-sizing problems with time windows. Operations Research 54 5 (2006) 951-967
25. Held M., Wolfe P., and Crowder H.D. Validation of subgradient optimization. Mathematical Programming 6 (1974) 62-88
26. Absi N. Modélisation et résolution de problèmes de lot-sizing à capacité finie. PhD thesis, Université Pierre et Marie Curie (Paris VI); 2005.
27. Millar H.H., and Yang M. Lagrangian heuristics for the capacitated multi-item lot-sizing problem with backordering. International Journal of Production Economics 34 (1994) 1-15