The multi-item capacitated lot-sizing problem with setup times and shortage costs

European Journal of Operational Research

Volumn 185, Issue 3, 2008, Pages 1351-1374

  Absi, Nabil ^a,b   Kedad Sidhoum, Safia ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b Dynasys SA   (France)

Author keywords

Banch and cut; Capacitated lot sizing; Mixed integer programming; Multi item; Production planning; Setup times; Shortage costs

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COSTS; INTEGER PROGRAMMING; PROBLEM SOLVING;

CAPACITATED LOT-SIZING; MIXED INTEGER PROGRAMMING; PRODUCTION PLANNING; SETUP TIMES; SHORTAGE COSTS;

PRODUCTION ENGINEERING;

EID: 34848866290     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.01.053     Document Type: Article

References (41)

1. Absi N., and Kedad-Sidhoum S. Une heuristique pour un problème de lot-sizing à capacité finie sous contraintes. Manifestation de JEunes Chercheurs STIC'04 (2004), Université du littoral, Calais, France
2. N. Absi, S. Kedad-Sidhoum. Multi-item capacitated lot-sizing problem with setup times and shortage costs: polyhedral results. Technical Report LIP6 2005/009, LIP6, 2005.
3. 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
4. Barany I., Van Roy T., and Wolsey L.A. Strong formulations for multi-item capacitated lot-sizing. Management Science 30 10 (1984) 1255-1261
5. Barany I., Van Roy T., and Wolsey L.A. Uncapacitated lot-sizing: The convex hull of solutions. Mathematical Programming Study 22 (1984) 32-43
6. Belvaux G., and Wolsey L.A. bc-prod: A specialized branch-and-cut system for lot-sizing problems. Management Science 46 (2000) 724-738
7. Bitran G., and Yanasse H.H. Computational complexity of the capacitated lot size problem. Management Science 28 (1982) 1174-1186
8. N. Brahimi. Planification de la production: modèles et algorithmes pour les problèmes de dimensionnement de lots. Ph.D. thesis, Université de Nantes, 2004.
9. Brahimi N., Dauzère-Pérès S., Najid N.M., and Nordli A. Single item lot sizing problems. European Journal of Operational Research 168 1 (2006) 1-16
10. 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
11. Constantino M. Lower bounds in lot-sizing models: A polyhedral study. Mathematics of Operations Research 23 (1998) 101-118
12. 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
13. Dixon P.S., Elder M.D., Rand G.K., and Silver E.A. A heuristic algorithm for determining lot sizes of an item subject to regular and overtime production capacities. Journal of Operations Management 3 (1983) 121-130
14. Evans J.R. An efficient implementation of the wagner-whitin algorithm for dynamic lot-sizing. Journal of Operations Management 5 2 (1985) 229-235
15. Florian M., Lenstra J.K., and Rinnoy Kan A.H.G. Deterministic production planning: Algorithms and complexity. Management Science 26 (1980) 669-679
16. R.E. Gomory, An algorithm for the mixed integer problem. Technical report, The Rand Corporation, 1960.
17. Gu Z., Nemhauser G.L., and Savelsbergh M.W.P. Sequence independent lifting in mixed integer programming. Journal of Combinatorial Optimization 4 (2000) 109-129
18. 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 ganzzahligen probleme (1977), Birkhauser Verlag, Basel 155-180
19. Leung J.M., Magnanti T.L., and Vachani R. Facets and algorithms for capacitated lot-sizing. Mathematical Programming 45 (1989) 331-359
20. CPLEX Callable Library. Ilog sa. , 2005.
21. Loparic M., Pochet Y., and Wolsey L.A. The uncapacitated lot-sizing problem with sales and safety stocks. Mathematical Programming 89 (2001) 487-504
22. LOTSIZELIB, 1999. .
23. Manne A.S. Programming of economic lot-sizes. Management Science 4 (1958) 115-135
24. Marchand H., and Wolsey L.A. The 0-1 knapsack problem with a single continuous variable. Mathematical Programming 85 (1999) 15-33
25. A.J. Miller. Polyhedral approaches to capacitated lot-sizing problems. Ph.D. thesis, Georgia Institute of Technology, 1999.
26. Miller A.J., Nemhauser G.L., and Savelsbergh M.W.P. On the polyhedral structure of a multi-item production planning model with setup times. Mathematical Programming 94 (2003) 375-405
27. Nemhauser G.L., and Wolsey L.A. A recursive procedure for generating all cuts for 0-1 mixed integer programs. Mathematical Programming 46 (1990) 379-390
28. Özdamar L., and Birbil S.I. Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions. European Journal of Operational Research 110 (1998) 525-547
29. Özdamar L., and Bozyel M.A. The capacitated lot sizing problem with overtime decisions and setup times. IIE Transactions 32 (2000) 1043-1057
30. Padberg M.W., J Van Roy T., and A Wolsey L. Valid linear inequalities for fixed charge problems. Operations Research 33 (1985) 842-861
31. Pochet Y., and Wolsey L.A. Lot-size models with backlogging: Strong reformulations and cutting planes. Mathematical Programming 40 (1988) 317-335
32. Pochet Y., and Wolsey L.A. Solving multi-item lot-sizing problems using strong cutting planes. Management Science 37 (1991) 53-67
33. Pochet Y., and Wolsey L.A. Lot-sizing with constant batches: Formulation and valid inequalities. Mathematics of Operations Research 18 (1993) 767-785
34. Van Roy T.J., and Wolsey L.A. Valid inequalities for mixed 0-1 programs. Discrete Applied Mathematics 14 (1986) 199-213
35. 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
36. Trigeiro W., Thomas L.J., and McLain J.O. Capacitated lot-sizing with setup times. Management Science 35 (1989) 353-366
37. van Hoesel C.P.M., Wagelmans A.P.M., and Wolsey L.A. Polyhedral characterization of the economic lot-sizing problem with start-up costs. Journal of Discrete Mathematics 7 (1994) 141-151
38. Wagner H.M., and Whitin T.M. A dynamic version of the economic lot size model. Management Science 5 (1958) 89-96
39. Wolsey L.A. Valid inequalities and superadditivity for 0/1 integer programs. Mathematics of Operations Research 2 (1977) 66-77
40. Wolsey L.A. Integer Programming (1998), Wiley, New York
41. Zangwill W.I. A deterministic multi-period production scheduling model with backlogging. Management Science 13 (1966) 105-119