Summary
Much progress has been made in recent years in solving certain classes of production planning problems using mixed integer programming. One of the major challenges is how to make this expertise available and relatively easy to use for the non-specialist and the practitioner. Here we describe a modeling approach and tool LS-LIB.
LS-LIB is a library of primitives to declare procedures/subroutines/global constraints in a high-level modeling language that we believe offers an interesting partial answer to this challenge. LS-LIB provides routines for problem reformulation, cut generation, and heuristic solution of instances. The user must provide an initial formulation of his problem in the chosen modeling language MOSEL. Then using knowledge of the problem the user must first classify each product or sku according to a simple three field scheme: [production type, capacity type, variant]. Then it is a simple matter to use the global constraints of LS-LIB by adding a few lines to the initial modeling language formulation to get a tightened formulation and/or call the appropriate cut generation routines. The heuristic procedures are called in a similar fashion. The result is a tool that allows researchers and end-users to improve the solution time and quality of a variety of production planning problems within minutes. The library incorporates much of the modeling knowledge concerning lot-sizing problems derived over the last twenty years, and is also easy to maintain and extend.
We illustrate the use of LS-LIB on an intractable two-level problem, and a difficult multi-level problem.
This text presents research results of the Belgian Program on Interuniversity Poles of Attraction initiated by the Belgian State, Prime Minister’s Office, Science Policy Programming. The scientific responsibility is assumed by the authors. Work of Yves Pochet carried out while at the Center of Operations Research and Econometrics (CORE) and Institut d’Administration et de Gestion (IAG), Université catholique de Louvain.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Afentakis, P., Gavish, B., Karmarkar, U.: Computationally efficient optimal solutions to the lot-sizing problem in multistage assembly systems. Manage. Sci. 30, 222–239 (1984)
Agra, A., Constantino, M.: Lotsizing with backlogging and start-ups: The case of Wagner–Whitin costs. Oper. Res. Lett. 25, 81–88 (1999)
Anily, S., Tzur, M., Wolsey, L.A.: Lot-sizing with family set-ups. Math. Program. (2008). doi:10.1007/s10107-007-0220-9
Atamtürk, A., Munoz, J.C.: A study of the lot-sizing polytope. Math. Program. 99, 443–466 (2004)
Barany, I., Van Roy, T.J., Wolsey, L.A.: Uncapacitated lot sizing: The convex hull of solutions. Math. Program. 22, 32–43 (1984)
Barany, I., Edmonds, J., Wolsey, L.A.: Packing and covering a tree by subtrees. Combinatorica 6, 245–257 (1986)
Belvaux, G., Wolsey, L.A.: Bc-prod: a specialized branch-and-cut system for lot-sizing problems. Manage. Sci. 46, 724–738 (2000)
Belvaux, G., Wolsey, L.A.: Modelling practical lot-sizing problems as mixed integer programs. Manage. Sci. 47, 993–1007 (2001)
Clark, A.J., Scarf, H.: Optimal policies for multi-echelon inventory problems. Manage. Sci. 6, 475–490 (1960)
Constantino, M.: A cutting plane approach to capacitated lot-sizing with start-up costs. Math. Program. 75, 353–376 (1996)
Constantino, M.: Lower bounds in lot-sizing models: A polyhedral study. Math. Oper. Res. 23, 101–118 (1998)
Danna, E., Rothberg, E., Le Pape, C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. 102, 71–90 (2005)
Di Summa, M., Wolsey, L.A.: Stochastic lot-sizing on a tree. Oper. Res. Lett. 36, 7–13 (2008)
Eppen, G.D., Martin, R.K.: Solving multi-item lot-sizing problems using variable definition. Oper. Res. 35, 832–848 (1987)
Fischetti, M., Lodi, A.: Local branching. Math. Program. 98, 23–48 (2003)
Gomory, R.E.: An algorithm for the mixed integer problem. Technical Report RM-2597, The RAND Corporation (1960)
Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Lifted flow cover inequalities for mixed 0–1 integer programs. Math. Program. 85, 439–467 (1998)
Krarup, J., Bilde, O.: Plant location, set covering and economic lot sizes: An O(mn) algorithm for structured problems. In: Collatz, L., et al. (eds.) Optimierung bei Graphentheoretischen und Ganzzahligen Probleme, pp. 155–180. Birkhäuser, Basel (1977)
Miller, A., Wolsey, L.A.: Tight MIP formulations for multi-item discrete lot-sizing problems. Oper. Res. 51, 557–565 (2003)
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)
Padberg, M.W., Van Roy, T.J., Wolsey, L.A.: Valid inequalities for fixed charge problems. Math. Program. 33, 842–861 (1985)
Pochet, Y.: Valid inequalities and separation for capacitated economic lot-sizing. Oper. Res. Lett. 7, 109–116 (1988)
Pochet, Y.: Mathematical programming models and formulations for deterministic production planning problems. In: Jünger, M., Naddef, D. (eds.) Computational Combinatorial Optimization. Lecture Notes in Computer Science, vol. 2241, pp. 57–111. Springer, Berlin (2001)
Pochet, Y., Wolsey, L.A.: Lot-size models with backlogging: Strong formulations and cutting planes. Math. Program. 40, 317–335 (1988)
Pochet, Y., Wolsey, L.A.: Polyhedra for lot-sizing with Wagner–Whitin costs. Math. Program. 67, 297–324 (1994)
Pochet, Y., Wolsey, L.A.: Algorithms and reformulations for lot sizing problems. In: Cook, W., Lovasz, L., Seymour, P. (eds.) Combinatorial Optimization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 20. Am. Math. Soc., Providence (1995)
Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming. Springer, New York (2006)
Pochet, Y., Wolsey, L.A.: Single item lot-sizing with non-decreasing capacities. Math. Program. (2008). doi:10.1007/s10107-008-0228-7
Stadtler, H.: Reformulations of the shortest-route model for dynamic multi-item multi-level capacitated lot-sizing. OR-Spektrum 19, 87–96 (1997)
Stadtler, H.: Improved rolling schedules for the dynamic single-level lot-sizing problem. Manage. Sci. 46, 318–326 (2000)
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., Derstoff, M.: A Lagrangean-based heuristic for dynamic multi-level multi-item constrained lot-sizing with set-up times. Manage. Sci. 42, 738–757 (1996)
van Eijl, C.A., van Hoesel, C.P.M.: On the discrete lot-sizing and scheduling problem with Wagner–Whitin costs. Oper. Res. Lett. 20, 7–13 (1997)
van Hoesel, C.P.M., Kolen, A.W.J.: A linear description of the discrete lot-sizing and scheduling problem. Eur. J. Oper. Res. 75, 342–353 (1994)
van Hoesel, C.P.M., Wagelmans, A., Wolsey, L.A.: Polyhedral characterization of the economic lot-sizing problem with start-up costs. SIAM J. Discrete Math. 7, 141–151 (1994)
Van Roy, T.J., Wolsey, L.A.: Valid inequalities for mixed 0–1 programs. Discrete Appl. Math. 14, 199–213 (1986)
Van Vyve, M.: Lot-sizing with constant lower bounds on production. Draft 2, CORE, Université catholique de Louvain (2003)
Van Vyve, M.: The continuous mixing polyhedron. Math. Oper. Res. 30, 441–452 (2005)
Van Vyve, M.: Linear-programming extended formulations for the single item lot-sizing problem with backlogging and constant capacity. Math. Program., Ser. A 108, 53–77 (2006)
Van Vyve, M., Wolsey, L.A.: Approximate extended formulations. Math. Program., Ser. B 105, 501–522 (2006)
Wolsey, L.A.: Integer Programming. Wiley, New York (1998)
Wolsey, L.A.: Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation. Manage. Sci. 48, 1587–1602 (2002)
Wolsey, L.A.: Lot-sizing with production and delivery time windows. Math. Program. 107, 471–489 (2006)
Xpress-MP. http://www.dashoptimization.com/ (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pochet, Y., Van Vyve, M., Wolsey, L.A. (2009). LS-LIB: A Library of Tools for Solving Production Planning Problems. In: Cook, W., Lovász, L., Vygen, J. (eds) Research Trends in Combinatorial Optimization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76796-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-76796-1_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76795-4
Online ISBN: 978-3-540-76796-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)