Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs

In this paper we develop new rolling-horizon and fix-and-relax heuristics for the identical parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs. Unlike previous papers, our procedures are based on a compact formulation relying on the hypotheses of identical machines. This feature makes our approach suitable for large-scale applications (with hundreds of machines) arising in the textile and fiberglass industries. Moreover, our procedures are shown to provide a feasible solution for any feasible instance. Comparisons with lower bounds provided by a truncated branch-and-bound show that the gap between the best heuristic solution and the lower bound never exceeds 3%.

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

[2]  A. Clark,et al.  Rolling-horizon lot-sizing when set-up times are sequence-dependent , 2000 .

[3]  Andrea T.. Staggemeier,et al.  A survey of lot-sizing and scheduling models , 2001 .

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

[5]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[6]  I. M. Ovacikt,et al.  Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times , 1994 .

[7]  Jiawei Zhang,et al.  Parallel machine scheduling with splitting jobs , 2000, Discret. Appl. Math..

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

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

[10]  Yves Pochet,et al.  Mathematical Programming Models and Formulations for Deterministic Production Planning Problems , 2000, Computational Combinatorial Optimization.

[11]  Herbert Meyr,et al.  Simultaneous lotsizing and scheduling by combining local search with dual reoptimization , 2000, Eur. J. Oper. Res..

[12]  A. Clark.  Rolling horizon heuristics for production planning and set-up scheduling with backlogs and error-prone demand forecasts , 2005 .

[13]  Alistair Clark.  Batch sequencing and sizing with regular varying demand , 1998 .

[14]  Robert T. Sumichrast,et al.  SCHEDULING PARALLEL PROCESSORS WITH SETUP COSTS AND RESOURCE LIMITATIONS , 1988 .

[15]  Paolo Serafini,et al.  Scheduling Jobs on Several Machines with the Job Splitting Property , 1996, Oper. Res..

[16]  Wu Zhang,et al.  On practical resource allocation for production planning and scheduling with period overlapping setups , 1994 .

[17]  Andrea T. Staggemeier,et al.  A hybrid genetic algorithm to solve a lot-sizing and scheduling problem , 2002 .

[18]  Michael Jünger,et al.  Computational Combinatorial Optimization , 2001, Lecture Notes in Computer Science.

[19]  Lionel Amodeo,et al.  A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times , 2006 .

[20]  Reha Uzsoy,et al.  Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. , 1995 .

[21]  Herbert Meyr,et al.  Simultaneous lotsizing and scheduling on parallel machines , 2002, Eur. J. Oper. Res..