Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem

In the context of a single machine, multi-item, continuous-time lot sizing and scheduling problem with a production rate alternating between the two values zero and full production rate, this paper identifies classes of equivalent problem instances which differ from one another in the way in which demand is represented. Each class contains an instance with a continuous cumulated demand function, and may contain demand functions with very different shapes, including functions with discontinuities. When approaching the problem (in order to solve it numerically, or to prove analytical results etc.), it therefore becomes possible to select, from many different representations, the problem instance which best meets the requirements of the applied method.

[1]  W. Hsu.  On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine , 1983 .

[2]  Zeger Degraeve,et al.  Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches , 2004, Eur. J. Oper. Res..

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

[4]  Herbert Jodlbauer.  An approach for integrated scheduling and lot-sizing , 2006, Eur. J. Oper. Res..

[5]  E. J. Anderson,et al.  Deterministic Lotsizing Models for Production Planning , 1991 .

[6]  S. Elmaghraby.  The Economic Lot Scheduling Problem (ELSP): Review and Extensions , 1978 .

[7]  Konstantin Kogan,et al.  Infinite horizon production planning with periodic demand: solvable cases and a general numerical approach , 2003 .

[8]  Herbert Meyr,et al.  The general lotsizing and scheduling problem , 1997 .

[9]  Alf Kimms,et al.  Lot sizing and scheduling -- Survey and extensions , 1997 .

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

[11]  K. Kogan.  Discrete event control of production flows: Make-to-stock and make-toorder environments , 1997 .

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

[13]  Stanley B. Gershwin,et al.  An algorithm for the computer control of a flexible manufacturing system , 1983 .

[14]  Konstantin Kogan,et al.  Optimal flow control of flexible manufacturing systems: Setup localization by an iterative procedure , 1997 .

[15]  Konstantin Kogan,et al.  Maximum principle-based methods for production scheduling with partially sequence-dependent setups , 1997 .

[16]  Thomas L. Magnanti,et al.  A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs , 1990, Oper. Res..

[17]  S. Bai,et al.  An optimal production flow control problem with piecewise constant demand , 1996 .

[18]  Jun Yang,et al.  Optimal Production and Setup Scheduling: A One-Machine, Two-Product System , 2000, Ann. Oper. Res..

[19]  Ford W. Harris,et al.  How Many Parts to Make at Once , 1990, Oper. Res..