Abstract
In this paper, we analyze a variety of approaches to obtain lower bounds for multi-level production planning problems with big bucket capacities, i.e., problems in which multiple items compete for the same resources. We give an extensive survey of both known and new methods, and also establish relationships between some of these methods that, to our knowledge, have not been presented before. As will be highlighted, understanding the substructures of difficult problems provide crucial insights on why these problems are hard to solve, and this is addressed by a thorough analysis in the paper. We conclude with computational results on a variety of widely used test sets, and a discussion of future research.
Similar content being viewed by others
Notes
Personal communication.
References
Akartunalı, K., Miller, A.J.: A heuristic approach for big bucket multi-level production planning problems. Eur. J. Oper. Res. 193, 396–411 (2009)
Akartunalı, K.: Computational methods for big bucket production planning problems: feasible solutions and strong formulations. Ph.D. thesis, Industrial and Systems Engineering Department, University of Wisconsin-Madison (2007)
Anily, S., Tzur, M., Wolsey, L.A.: Multi-item lot-sizing with joint set-up costs. Math. Program. 119(1), 79–94 (2009)
Atamtürk, A., Muñoz, J.C.: A study of the lot-sizing polytope. Math. Program. 98, 443–465 (2004)
Barany, I., Van Roy, T.J., Wolsey, L.A.: Strong formulations for multi-item capacitated lot-sizing. Manag. Sci. 30(10), 1255–1261 (1984)
Barany, I., Van Roy, T.J., Wolsey, L.A.: Uncapacitated lot sizing: the convex hull of solutions. Math. Program. Stud. 22, 32–43 (1984)
Belvaux, G., Wolsey, L.A.: bc-prod: A specialized branch-and-cut system for lot-sizing problems. Manag. Sci. 46(5), 724–738 (2000)
Belvaux, G., Wolsey, L.A.: Modelling practical lot-sizing problems as mixed-integer programs. Manag. Sci. 47(7), 993–1007 (2001)
Billington, P.J., McClain, J.O., Thomas, L.J.: Heuristics for multilevel lot-sizing with a bottleneck. Manag. Sci. 32, 989–1006 (1986)
Bitran, G.R., Matsuo, H.: The multi-item capacitated lot size problem: error bounds of Manne’s formulations. Manag. Sci. 32, 350–359 (1986)
Bitran, G.R., Yanasse, H.H.: Computational complexity of the capacitated lot size problem. Manag. Sci. 28(10), 1174–1186 (1982)
Buschkühl, L., Sahling, F., Helber, S., Tempelmeier, H.: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches. OR Spektrum 32(2), 231–261 (2010)
Constantino, M.: A cutting plane approach to capacitated lot-sizing with start-up costs. Math. Program. 75, 353–376 (1996)
Degraeve, Z., Jans, R.: A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times. Oper. Res. 55(5), 909–920 (2007)
Eppen, G.D., Martin, R.K.: Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper. Res. 35(6), 832–848 (1987)
Federgruen, A., Tzur, M.: A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(nlogn) or O(n) time. Manag. Sci. 37(8), 909–925 (1991)
Federgruen, A., Meissner, J., Tzur, M.: Progressive interval heuristics for multi-item capacitated lot sizing problem. Oper. Res. 55(3), 490–502 (2007)
Florian, M., Klein, M.: Deterministic production planning with concave costs and capacity constraints. Manag. Sci. 18(1), 12–20 (1971)
Florian, M., Lenstra, J.K., Rinnooy Kan, H.G.: Deterministic production planning: algorithms and complexity. Manag. Sci. 26(7), 669–679 (1980)
Günlük, O., Pochet, Y.: Mixing mixed integer inequalities. Math. Program. 90, 429–457 (2001)
Jans, R., Degraeve, Z.: Improved lower bounds for the capacitated lot sizing problem with setup times. Oper. Res. Lett. 32, 185–195 (2004)
Katok, E., Lewis, H.S., Harrison, T.P.: Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources. Manag. Sci. 44(6), 859–877 (1998)
Krarup, J., Bilde, O.: Plant location, set covering and economic lotsizes: an O(mn) algorithm for structured problems. In: Optimierung bei Graphentheoretischen und Ganzzahligen Probleme, pp. 155–180. Birkhauser, Basel (1977)
Küçükyavuz, S., Pochet, Y.: Uncapacitated lot-sizing with backlogging: the convex hull. Math. Program. 118(1), 151–175 (2009)
Levi, R., Lodi, A., Sviridenko, M.: Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities. Math. Oper. Res. 33(2), 461–474 (2008)
Loparic, M., Pochet, Y., Wolsey, L.A.: The uncapacitated lot-sizing problem with sales and safety stocks. Math. Program. 89, 487–504 (2001)
LOTSIZELIB. Lot-sizing problems: a library of models and matrices (1999). http://www.core.ucl.ac.be/wolsey/lotsizel.htm
Manne, A.S.: Programming of economic lot sizes. Manag. Sci. 4(2), 115–135 (1958)
Marchand, H., Wolsey, L.A.: The 0-1 knapsack problem with a single continuous variable. Math. Program. 85(1), 15–33 (1999)
Marchand, H., Wolsey, L.A.: Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49(3), 363–371 (2001)
Miller, A.J., Nemhauser, G.L., Savelsbergh, M.W.P.: Solving the multi-item capacitated lot-sizing problem with setup times by branch-and-cut. CORE Discussion Paper 2000/39, CORE, UCL, Belgium (2000)
Miller, A.J., Nemhauser, G.L., Savelsbergh, M.W.P.: On the polyhedral structure of a multi-item production planning model with setup times. Math. Program. 94, 375–405 (2003)
Multi-LSB: Multi-item lot-sizing problems with backlogging: a library of test instances (2010). Available at http://personal.strath.ac.uk/kerem.akartunali/research/multi-lsb/
Pochet, Y., Wolsey, L.A.: Lot-size models with backlogging: Strong reformulations and cutting planes. Math. Program. 40, 317–335 (1988)
Pochet, Y., Wolsey, L.A.: Solving multi-item lot-sizing problems using strong cutting planes. Manag. Sci. 37(1), 53–67 (1991)
Pochet, Y., Wolsey, L.A.: Polyhedra for lot-sizing with Wagner-Whitin costs. Math. Program. 67, 297–323 (1994)
Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming. Springer, Berlin (2006)
Rardin, R.L., Wolsey, L.A.: Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems. Eur. J. Oper. Res. 71, 95–109 (1993)
Richard, J.-P.P., de Farias, I.R., Nemhauser, G.L.: Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms. Math. Program. 98(1–3), 89–113 (2003)
Richard, J.-P.P., de Farias, I.R., Nemhauser, G.L.: Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting. Math. Program. 98(1–3), 115–143 (2003)
Simpson, N.C., Erenguc, S.S.: Modeling multiple stage manufacturing systems with generalized costs and capacity issues. Nav. Res. Logist. 52, 560–570 (2005)
Stadtler, H.: Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Oper. Res. 51, 487–502 (2003)
Tempelmeier, H., Derstroff, M.: A lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times. Manag. Sci. 42(5), 738–757 (1996)
Thizy, J.M., Van Wassenhove, L.N.: Lagrangean relaxation for the multi-item capacitated lot-sizing problem: A heuristic implementation. IIE Trans. 17(4), 308–313 (1985)
Trigeiro, W.W., Thomas, L.J., McClain, J.O.: Capacitated lot sizing with setup times. Manag. Sci. 35, 353–366 (1989)
Van Vyve, M., Pochet, Y.: A general heuristic for production planning problems. INFORMS J. Comput. 16(3), 316–327 (2004)
Wagner, H.M., Whitin, T.M.: Dynamic version of the economic lot size model. Manag. Sci. 5, 89–96 (1958)
Wolsey, L.A.: Integer Programming. Wiley-Interscience, New York (1998)
Wolsey, L.A.: Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation. Manag. Sci. 48(12), 1587–1602 (2002)
Zangwill, W.I.: A backlogging model and a multi-echelon model of a dynamic economic lot size production system—a network approach. Manag. Sci. 15(9), 506–527 (1969)
Acknowledgements
We would like to thank two anonymous referees for their constructive comments that helped us to improve the presentation of the paper. The research carried out was supported in part by the National Science Foundation grant No. DMI 0323299.
Author information
Authors and Affiliations
Corresponding author
Electronic Supplementary Material
Below is the link to the electronic supplementary material.
Rights and permissions
About this article
Cite this article
Akartunalı, K., Miller, A.J. A computational analysis of lower bounds for big bucket production planning problems. Comput Optim Appl 53, 729–753 (2012). https://doi.org/10.1007/s10589-012-9465-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-012-9465-z