Period decompositions for the capacitated lot sizing problem with setup times

INFORMS Journal on Computing

Volumn 27, Issue 3, 2015, Pages 431-448

  De Araujo, Silvio Alexandre ^a   De Reyck, Bert ^b   Degraeve, Zeger ^c,d   Fragkos, Ioannis ^e   Jans, Raf ^f  

^a SÃO PAULO STATE UNIVERSITY UNESP   (Brazil)

^b UNIVERSITY COLLEGE LONDON   (United Kingdom)

^c UNIVERSITY OF MELBOURNE   (Australia)

^d LONDON BUSINESS SCHOOL   (United Kingdom)

^e ERASMUS UNIVERSITY   (Netherlands)

^f HEC MONTRÉAL   (Canada)

Author keywords

Accepted by Karen Aardal; Branch and price; Column generation; Heuristics History; Lagrange relaxation; Lot sizing

Indexed keywords

INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS;

ACCEPTED BY KAREN AARDAL; BRANCH AND PRICE; COLUMN GENERATION; LAGRANGE RELAXATION; LOT SIZING;

LINEAR PROGRAMMING;

EID: 84930672696     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.2014.0636     Document Type: Article

References (43)

1. Alfieri A, Brandimarte P, DOrazio S (2002) LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm. Internat. J. Production Res. 40:441-458.
2. Barahona F, Anbil R (2000) The volume algorithm: Producing primal solutions with a subgradient method. Math. Programming 87:385-399.
3. Barahona F, Jensen D (1998) Plant location with minimum inventory. Math. Programming 83:101-111.
4. Barany I, Van Roy TJ, Wolsey LA (1984) Strong formulations for multi-item capacitated lot sizing. Management Sci. 30: 1255-1261.
5. Belvaux G, Wolsey LA (2000) bc-prod: A specialized branch-Andcut system for lot-sizing problems. Management Sci. 46:724-738.
6. Ben Amor H, Desrosiers J, Valrio de Carvalho JM (2006) Dualoptimal inequalities for stabilized column generation. Oper. Res. 54:454-463.
7. Buschkhl L, Sahling F, Helber S, Tempelmeier H (2010) Dynamic capacitated lot-sizing problems: A classification and review of solution approaches. OR Spectrum 32:231-261.
8. Caserta M, Rico EQ (2009) A cross-entropy Lagrangian hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times. Comput. Oper. Res. 36:530-548.
9. Crowder H (1976) Computational improvements for subgradient optimization. Sympos. Mathematica XIX:357-372.
10. Danna E, Rothberg E, Le Pape C (2005) Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Programming Ser. A 102:71-90.
11. Degraeve Z, Jans R (2007) A new Dantzig-Wolfe reformulation and branch-And-price algorithm for the capacitated lot-sizing problem with setup times. Oper. Res. 55:909-920.
12. Degraeve Z, Peeters M (2003) Optimal integer solutions to industrial cutting-stock problems: Part 2, benchmark results. INFORMS J. Comput. 15:58-81.
13. Denizel M, Sral H (2006) On alternative mixed integer programming formulation and LB-based heuristics for lot-sizing with setup times. J. Oper. Res. Society 57:389-399.
14. Denizel M, Altekin FT, Sral H, Stadtler H (2008) Equivalence of the LP relaxation of two strong formulations for the capacitated lot-sizing problem with setup times. OR Spectrum 30:773-785.
15. du Merle O, Villeneuve D, Desrosiers J, Hansen P (1999) Stabilized column generation. Discrete Math. 194:229-237.
16. Eppen GD, Martin RK (1987) Solving multi-item capacitated lotsizing problems using variable redefinition. Oper. Res. 35: 832-848.
17. Fiorotto DJ, de Araujo SA (2014) Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines. Annals Oper. Res. 217:213-231.
18. Fischetti M, Lodi A (2003) Local branching. Math. Programming Ser. B 98:23-47.
19. Geoffrion AM (1974) Lagrangean relaxation for integer programming. Math. Programming Study 2:82-114.
20. Graham RL (1972) An efficient algorithm for determining the convex hull of a finite planar set. Inform. Processing Lett. 1:132-133.
21. Helber S, Sahling F (2010) A fix-And-optimize approach for the multi-level capacitated lot sizing problem. Internat. J. Production Econom. 123:247-256.
22. Holmberg K, Yuan D (2000) A Lagrangian heuristic based branchand-bound approach for the capacitated network design problem. Oper. Res. 48:461-481.
23. Huisman D, Jans R, Peeters M, Wagelmans APM (2005) Combining column generation and Lagrangian relaxation. Desaulniers G, Desrosiers J, Solomon M, eds. Column Generation (Springer, New York), 247-270.
24. Jans R, Degraeve Z (2004) Improved lower bounds for the capacitated lot-sizing problem with setup times. Oper. Res. Lett. 32:185-195.
25. Krarup J, Bilde I (1977) Plant location, set covering and economic lot size: An O(mn) algorithm for structural problems. Numerische Methoden Bei Optimierungsaufgaben, Band 3: Optimierung Bei Graphentheoretischen und Ganzzahligen Problemen, Vol. 36 (Birkhauser Verlag, Stuttgart).
26. Levi R, Lodi A, Sviridenko M (2008) Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities. Math. Oper. Res. 33:461-474.
27. Manne AS (1958) Programming of economic lot sizes. Management Sci. 4:115-135.
28. Miller AJ, Nemhauser GL, Savelsbergh MW (2000a) Solving multi-item capacitated lot-sizing problems with setup times by branch-And-cut. CORE Discussion paper 2000/39, UCL, Louvain-la-Neuve, Belgium.
29. Miller AJ, Nemhauser GL, Savelsbergh MWP (2000b) On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra. Eur. J. Oper. Res. 125:298-315.
30. Miller AJ, Nemhauser GL, Savelsbergh MWP (2003) On the polyhedral structure of a multi-item producting planning model with setup times. Math. Programming 94:375-405.
31. Mller LF, Spoorendonk S, Pisinger D (2012) A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times. Eur. J. Oper. Res. 218:614-623.
32. Pimentel CMO, Alvelos FP, Valrio de Carvalho JM (2010) Comparing Dantzig-Wolfe decompositions and branch-And-price algorithms for the multi-item capacitated lot sizing problem. Optim. Methods Software 25:299-319.
33. Pochet Y, Van Vyve M (2004) A general heuristic for production planning problems. INFORMS J. Comput. 16:316-327.
34. Pochet Y, Wolsey LA (2006) Production Planning by Mixed Integer Programming (Springer-Verlag, New York).
35. Sinha P, Zoltners AA (1979) The multiple-choice knapsack problem. Oper. Res. 27:503-515.
36. Stadtler H (2003) Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Oper. Res. 51:487-502.
37. Stadtler H (2007) Collaborative planning-Concepts, framework and challenges. Waldmann K-H, Stocker UM, eds. Oper. Res. Proc. (Springer, Berlin, Heidelberg), 129.
38. Sral H, Denizel M, Van Wassenhove LN (2009) Lagrangean relaxation based heuristics for lot sizing with setup times. Eur. J. Oper. Res. 194:51-63.
39. Tempelmeier H (2011) A column generation heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint. Omega 39:627-633.
40. Trigeiro WW, Thomas LJ, McClain JO (1989) Capacitated lot sizing with setup times. Management Sci. 35:353-366.
41. Van Vyve M, Wolsey L (2006) Approximate extended formulations. Math. Programming Ser. B 105:501-522.
42. Vanderbeck F (1998) Lot-sizing with start-up times. Management Sci. 44:1409-1425.
43. Wolsey LA (1989) Uncapacitated lot-sizing problems with start-up costs. Oper. Res. 37:741-747.