Polyhedral Characterization of the Economic Lot-Sizing Problemwith Start-Up Costs

A class of strong valid inequalities is described for the single-item uncapacitated economic lot-sizing problem with start-up costs. It is shown that these inequalities yield a complete polyhedral characterization of the problem. The corresponding separation problem is formulated as a shortest path problem. Finally, a reformulation as a plant location problem is shown to imply the class of strong valid inequalities, which shows that this reformulation is tight, also.

[1]  Alan S. Manne,et al.  Programming of Economic Lot Sizes , 1958 .

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

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

[4]  Linus Schrage,et al.  The Multiproduct Lot Scheduling Problem , 1982 .

[5]  Luk N. Van Wassenhove,et al.  Planning production in a bottleneck department , 1983 .

[6]  Laurence A. Wolsey,et al.  Strong Formulations for Multi-Item Capacitated Lot Sizing , 1984 .

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

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

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

[10]  Thomas L. Magnanti,et al.  Facets and algorithms for capacitated lot sizing , 1989, Math. Program..

[11]  Laurence A. Wolsey,et al.  Uncapacitated Lot-Sizing Problems with Start-Up Costs , 1989, Oper. Res..

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

[13]  Albert P. M. Wagelmans,et al.  A Dual Algorithm for the Economic Lot-Sizing Problem , 1991 .

[14]  Laurence A. Wolsey,et al.  Multi-item lot-sizing problems using strong cutting planes , 1991 .

[15]  C.P.M. van Hoesel.  Models and algorithms for single-item lot sizing problems , 1991 .

[16]  Ivo Adan,et al.  The effect of varying routing probability in two parallel queues with dynamic routing under a threshold-type scheduling , 1992 .