Simultaneous lotsizing and scheduling by combining local search with dual reoptimization

Abstract The contribution of this paper is twofold. On the one hand, the particular problem of integrating lotsizing and scheduling of several products on a single, capacitated production line is modelled and solved, taking into account sequence-dependent setup times. Thereby, continuous lotsizes, meeting deterministic dynamic demands, are to be determined and scheduled with the objective of minimizing inventory holding costs and sequence-dependent setup costs. On the other hand, a new general algorithmic approach is presented: A dual reoptimization algorithm is combined with a local search heuristic for solving a mixed integer programming problem. This idea is applied to the above lotsizing and scheduling problem by embedding a dual network flow algorithm into threshold accepting and simulated annealing, respectively. Computational tests show the effectiveness of the new solution method.

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

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

[3]  Rema Padman,et al.  Dual Algorithms for Pure Network Problems , 1989, Oper. Res..

[4]  Darwin Klingman,et al.  Augmented Threaded Index Method for Network Optimization. , 1974 .

[5]  Marc Salomon,et al.  Batching decisions: structure and models , 1994 .

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[8]  Dwight E. Smith-Daniels,et al.  A mixed integer programming model for lot sizing and sequencing packaging lines in the process industries , 1986 .

[9]  Jeffery L. Kennington,et al.  Primal simplex network codes: State-of-the-art implementation technology , 1978, Networks.

[10]  K. Haase.  Lotsizing and Scheduling for Production Planning , 1994 .

[11]  Uwe H. Suhl,et al.  MOPS -- Mathematical optimization system , 1994 .

[12]  T. B. Boffey.  Linear Network Optimization: Algorithms and Codes , 1994 .

[13]  Jatinder N. D. Gupta,et al.  OR Practice - Determining Lot Sizes and Resource Requirements: A Review , 1987, Oper. Res..

[14]  Laurence A. Wolsey,et al.  MIP modelling of changeovers in production planning and scheduling problems , 1997 .

[15]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[16]  David M. Miller,et al.  A framework for modelling setup carryover in the capacitated lot sizing problem , 1995 .

[17]  A. Drexl,et al.  Proportional lotsizing and scheduling , 1995 .

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

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

[20]  M. Pirlot,et al.  Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem , 1995 .

[21]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[22]  Gerald G. Brown,et al.  Design and Implementation of Large-Scale Primal Transshipment Algorithms , 1976 .

[23]  Marc Salomon,et al.  LINEAR PROGRAMMING, SIMULATED ANNEALING AND TABU SEARCH HEURISTICS FOR LOTSIZING IN BOTTLENECK ASSEMBLY SYSTEMS , 1993 .

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

[25]  Carsten Jordan,et al.  Batching and Scheduling , 1996 .

[26]  Kavindra Malik,et al.  Lotsizing and Scheduling in Parallel Machines with Sequence-Dependent Setup Costs , 1999 .

[27]  G. Dueck.  New optimization heuristics , 1993 .

[28]  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..

[29]  L. J. Thomas,et al.  Efficient Solutions to a Linear Programming Model for Production Scheduling With Capacity Constraints and No Initial Stock , 1989 .

[30]  B. Fleischmann,et al.  Konzeptionelle Grundlagen kapazitätsorientierter PPS-Systeme , 1993 .

[31]  Dimitri P. Bertsekas,et al.  RELAX-IV : a faster version of the RELAX code for solving minimum cost flow problems , 1994 .

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

[33]  Renato de Matta,et al.  Studying the effects of production loss due to setup in dynamic production scheduling , 1994 .