A solution approach of production planning problems based on compact formulations for single-item lot-sizing models

Abstract.We survey the main results presented in the author’s PhD Thesis presented in June 2003 at the Université catholique de Louvain and supervised by Y. Pochet and L. A. Wolsey. The dissertation is written in English and is available from the author. In the first part of the thesis, we investigate the complexity and the polyhedral structure of various extensions of the uncapacitated single-item lot-sizing problem (Barany et al. 1984). In particular, we study models involving fixed charges on stocks, constant capacity and backlogging, and lower bounds on production. We describe algorithms, extended formulations, (facet-defining) valid inequalities and separation algorithms. Emphasis is placed on compact (i.e. of polynomial size) exact extended formulations. In a second part, we show how such extended reformulations for single-item problems can help to improve the solution of much more general production planning problems.

[1]  Laurence A. Wolsey,et al.  Polyhedra for lot-sizing with Wagner—Whitin costs , 1994, Math. Program..

[2]  Laurence A. Wolsey,et al.  Lot-Sizing with Constant Batches: Formulation and Valid Inequalities , 1993, Math. Oper. Res..

[3]  Miguel Fragoso Constantino,et al.  Lotsizing with backlogging and start-ups: the case of Wagner-Whitin costs , 1999, Oper. Res. Lett..

[4]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[5]  Laurence A. Wolsey,et al.  Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems , 2003, Oper. Res..

[6]  Albert P. M. Wagelmans,et al.  An $O(T^3)$ algorithm for the economic lot-sizing problem with constant capacities , 1993 .

[7]  Miguel Constantino,et al.  Lower Bounds in Lot-Sizing Models: A Polyhedral Study , 1998, Math. Oper. Res..

[8]  Ting-Yi Sung,et al.  An analytical comparison of different formulations of the travelling salesman problem , 1991, Math. Program..

[9]  B. Fleischmann.  The discrete lot-sizing and scheduling problem with sequence-dependent setup costs , 1994 .

[10]  Stan P. M. van Hoesel,et al.  On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs , 1997, Oper. Res. Lett..

[11]  Martin W. P. Savelsbergh,et al.  A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case , 2003, Math. Program..

[12]  J. Krarup,et al.  Plant location, Set Covering and Economic Lot Size: An 0 (mn)-Algorithm for Structured Problems , 1977 .

[13]  Laurence A. Wolsey,et al.  The uncapacitated lot-sizing problem with sales and safety stocks , 2001, Math. Program..

[14]  G. Bitran,et al.  Computational Complexity of the Capacitated Lot Size Problem , 1982 .

[15]  W. Zangwill.  Minimum Concave Cost Flows in Certain Networks , 1968 .

[16]  Uday S. Karmarkar,et al.  The Deterministic Dynamic Product Cycling Problem , 1985, Oper. Res..

[17]  Laurence A. Wolsey,et al.  bc -- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems , 2000 .

[18]  Laurence A. Wolsey,et al.  Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation , 2002, Manag. Sci..

[19]  Laurence A. Wolsey,et al.  Uncapacitated lot-sizing: The convex hull of solutions , 1984 .

[20]  van Ca Cleola Eijl.  A polyhedral approach to the discrete lot-sizing and scheduling problem , 1996 .

[21]  C. Sch.,et al.  Konrad-Zuse-Zentrum für Informationstechnik Berlin , 2007 .

[22]  Mihalis Yannakakis,et al.  Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.

[23]  Matteo Fischetti,et al.  Local branching , 2003, Math. Program..

[24]  Albert P. M. Wagelmans,et al.  Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case , 1992, Oper. Res..

[25]  László Lovász,et al.  Graph Theory and Integer Programming , 1979 .

[26]  P. Gács,et al.  Khachian's Algorithm for Linear Programming. , 1979 .

[27]  Daniel Bienstock,et al.  Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice , 2002 .

[28]  William W. Trigeiro,et al.  Capacitated lot sizing with setup times , 1989 .

[29]  M. Florian,et al.  DETERMINISTIC PRODUCTION PLANNING WITH CONCAVE COSTS AND CAPACITY CONSTRAINTS. , 1971 .

[30]  Laurence A. Wolsey,et al.  Valid inequalities for mixed 0-1 programs , 1986, Discret. Appl. Math..

[31]  G. Nemhauser,et al.  Solving Multi-Item Capacitated Lot-Sizing Problems with Setup Times by Branch-and-Cut , 2000 .

[32]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[33]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[34]  Apm Wagelmans,et al.  Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions , 1994 .

[35]  A. Federgruen,et al.  A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0n log n or 0n Time , 1991 .

[36]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[37]  Alok Aggarwal,et al.  Improved Algorithms for Economic Lot Size Problems , 1993, Oper. Res..

[38]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[39]  G. Nemhauser,et al.  Integer Programming , 2020 .

[40]  Oktay Günlük,et al.  Mixing mixed-integer inequalities , 2001, Math. Program..

[41]  Laurence A. Wolsey,et al.  Lot-size models with backlogging: Strong reformulations and cutting planes , 1988, Math. Program..

[42]  J. K. Lenstra,et al.  Deterministic Production Planning: Algorithms and Complexity , 1980 .

[43]  Leon S. Lasdon,et al.  An Efficient Algorithm for Multi-Item Scheduling , 1971, Oper. Res..

[44]  Robert J. Vanderbei,et al.  Linear Programming: Foundations and Extensions , 1998, Kluwer international series in operations research and management service.

[45]  G. D. Eppen,et al.  Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition , 1987, Oper. Res..

[46]  Martin W. P. Savelsbergh,et al.  On the polyhedral structure of a multi–item production planning model with setup times , 2003, Math. Program..

[47]  Laurence A. Wolsey,et al.  Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems , 1993 .

[48]  B. Fleischmann.  The discrete lot-sizing and scheduling problem , 1990 .

[49]  W. Zangwill.  A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System---A Network Approach , 1969 .

[50]  M. Goemans.  Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds , 1989 .

[51]  Laurence A. Wolsey,et al.  Algorithms and reformulations for lot sizing problems , 1994, Combinatorial Optimization.