Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times

References

• Alfieri A, Brandimarte P, D’Orazio 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.Crossref, Google Scholar
• Barahona F, Anbil R (2000) The volume algorithm: Producing primal solutions with a subgradient method. Math. Programming 87:385–399.Crossref, Google Scholar
• Barahona F, Jensen D (1998) Plant location with minimum inventory. Math. Programming 83:101–111.Crossref, Google Scholar
• Barany I, Van Roy TJ, Wolsey LA (1984) Strong formulations for multi-item capacitated lot sizing. Management Sci. 30:1255–1261.Link, Google Scholar
• Belvaux G, Wolsey LA (2000) bc—prod: A specialized branch-and-cut system for lot-sizing problems. Management Sci. 46:724–738.Link, Google Scholar
• Ben Amor H, Desrosiers J, Valèrio de Carvalho JM (2006) Dual-optimal inequalities for stabilized column generation. Oper. Res. 54:454–463.Link, Google Scholar
• Buschkühl 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.Crossref, Google Scholar
• 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.Crossref, Google Scholar
• Crowder H (1976) Computational improvements for subgradient optimization. Sympos. Mathematica XIX:357–372.Google Scholar
• Danna E, Rothberg E, Le Pape C (2005) Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Programming Ser. A 102:71–90.Crossref, Google Scholar
• 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.Link, Google Scholar
• Degraeve Z, Peeters M (2003) Optimal integer solutions to industrial cutting-stock problems: Part 2, benchmark results. INFORMS J. Comput. 15:58–81.Link, Google Scholar
• Denizel M, Süral 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.Crossref, Google Scholar
• Denizel M, Altekin FT, Süral 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.Crossref, Google Scholar
• du Merle O, Villeneuve D, Desrosiers J, Hansen P (1999) Stabilized column generation. Discrete Math. 194:229–237.Crossref, Google Scholar
• Eppen GD, Martin RK (1987) Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper. Res. 35:832–848.Link, Google Scholar
• Fiorotto DJ, de Araujo SA (2014) Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines. Annals Oper. Res. 217:213–231.Crossref, Google Scholar
• Fischetti M, Lodi A (2003) Local branching. Math. Programming Ser. B 98:23–47.Crossref, Google Scholar
• Geoffrion AM (1974) Lagrangean relaxation for integer programming. Math. Programming Study 2:82–114.Crossref, Google Scholar
• Graham RL (1972) An efficient algorithm for determining the convex hull of a finite planar set. Inform. Processing Lett. 1:132–133.Crossref, Google Scholar
• 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.Crossref, Google Scholar
• Holmberg K, Yuan D (2000) A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. 48:461–481.Link, Google Scholar
• 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.Crossref, Google Scholar
• Jans R, Degraeve Z (2004) Improved lower bounds for the capacitated lot-sizing problem with setup times. Oper. Res. Lett. 32:185–195.Crossref, Google Scholar
• 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).Crossref, Google Scholar
• 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.Link, Google Scholar
• Manne AS (1958) Programming of economic lot sizes. Management Sci. 4:115–135.Link, Google Scholar
• 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.Google Scholar
• 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.Crossref, Google Scholar
• 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.Crossref, Google Scholar
• Müller 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.Crossref, Google Scholar
• Pimentel CMO, Alvelos FP, Valèrio 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.Crossref, Google Scholar
• Pochet Y, Van Vyve M (2004) A general heuristic for production planning problems. INFORMS J. Comput. 16:316–327.Link, Google Scholar
• Pochet Y, Wolsey LA (2006) Production Planning by Mixed Integer Programming (Springer-Verlag, New York).Google Scholar
• Sinha P, Zoltners AA (1979) The multiple-choice knapsack problem. Oper. Res. 27:503–515.Link, Google Scholar
• 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.Link, Google Scholar
• Stadtler H (2007) Collaborative planning—Concepts, framework and challenges. Waldmann K-H, Stocker UM, eds. Oper. Res. Proc. (Springer, Berlin, Heidelberg), 129.Crossref, Google Scholar
• Süral H, Denizel M, Van Wassenhove LN (2009) Lagrangean relaxation based heuristics for lot sizing with setup times. Eur. J. Oper. Res. 194:51–63.Crossref, Google Scholar
• Tempelmeier H (2011) A column generation heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint. Omega 39:627–633.Crossref, Google Scholar
• Trigeiro WW, Thomas LJ, McClain JO (1989) Capacitated lot sizing with setup times. Management Sci. 35:353–366.Link, Google Scholar
• Van Vyve M, Wolsey L (2006) Approximate extended formulations. Math. Programming Ser. B 105:501–522.Crossref, Google Scholar
• Vanderbeck F (1998) Lot-sizing with start-up times. Management Sci. 44:1409–1425.Link, Google Scholar
• Wolsey LA (1989) Uncapacitated lot-sizing problems with start-up costs. Oper. Res. 37:741–747.Link, Google Scholar