Discrete Lotsizing and Scheduling by Batch Sequencing

The discrete lotsizing and scheduling problem for one machine with sequence-dependent setup times and setup costs is solved as a single machine scheduling problem, which we term the batch sequencing problem. The relationship between the lotsizing problem and the batch sequencing problem is analyzed. The batch sequencing problem is solved with a branch & bound algorithm which is accelerated by bounding and dominance rules. The algorithm is compared with recently published procedures for solving variants of the DLSP and is found to be more efficient if the number of items is not large.

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

[2]  John L. Bruno,et al.  Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs , 1978, SIAM J. Comput..

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  David S. Johnson,et al.  Computers and Inrracrobiliry: A Guide ro the Theory of NP-Completeness , 1979 .

[5]  Michael J. Magazine,et al.  Batching in single operation manufacturing systems , 1985 .

[6]  Clyde L. Monma,et al.  On the Complexity of Scheduling with Batch Setup Times , 1989, Oper. Res..

[7]  Byong-Hun Ahn,et al.  Single facility multi-class job scheduling , 1990, Comput. Oper. Res..

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

[9]  Edward Anderson,et al.  Minimizing flow time on a single machine with job classes and setup times , 1991 .

[10]  L. V. Wassenhove,et al.  Some extensions of the discrete lotsizing and scheduling problem , 1991 .

[11]  Chris N. Potts,et al.  Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity , 1992 .

[12]  Dirk Cattrysse,et al.  A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times , 1993 .

[13]  Raymond G. Vickson,et al.  BATCHING AND SEQUENCING OF COMPONENTS AT A SINGLE FACILITY , 1993 .

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

[15]  Knut Haase,et al.  Capacitated lot-sizing with sequence dependent setup costs , 1996 .

[16]  Whm Henk Zijm,et al.  Single-machine scheduling with release dates, due dates and family setup times , 1994 .

[17]  Kenneth R. Baker,et al.  Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..

[18]  Jacques Desrosiers,et al.  An Optimal Algorithm for the Traveling Salesman Problem with Time Windows , 1991, Oper. Res..

[19]  Carsten Jordan.  Batching and Scheduling: Models and Methods for Several Problem Classes , 1996 .

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

[21]  Alf Kimms,et al.  Lot Sizing and Scheduling with Sequence Dependent Setup Costs and Times and Efficient Rescheduling O , 2000 .

[22]  Stéphane Dauzère-Pérès,et al.  Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows , 1997, Eur. J. Oper. Res..

[23]  Hermann Jahnke,et al.  Remarks on: "Some Extensions of the Discrete Lotsizing and Scheduling Problem" , 1997 .