MIP-based heuristics for lotsizing in capacitated pure flow shop with sequence-dependent setups

Lotsizing in capacitated pure flow shop with sequence-dependent setups has been considered in this paper. An exact formulation of the problem is provided as a mixed-integer program. It is well known that the capacitated lotsizing and scheduling problem (CLSP) is NP-hard. The introduction of serially arranged machines and sequence-dependent setups makes the problem even more complicated. Five MIP-based heuristics based on iterative procedures are provided. The first three heuristics are based on the original model but to solve non-small instances of problem, the last two heuristics are based on permutation flow shop problem which ignores the majority of combinations. To test the accuracy of heuristics, two lower bounds are developed and compared against the optimal solution. The trade-offs between solution quality and computational times of heuristics are also provided.

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

[2]  Horst Tempelmeier,et al.  Dynamic multi-machine lotsizing and sequencing with simultaneous scheduling of a common setup resource , 2008 .

[3]  Alistair R. Clark,et al.  Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups , 2007, J. Heuristics.

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

[5]  Alf Kimms,et al.  Some insights into proportional lot sizing and scheduling , 1998, J. Oper. Res. Soc..

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

[7]  Diwakar Gupta,et al.  The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times , 2005, Comput. Oper. Res..

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

[9]  Alistair R. Clark,et al.  Lot sizing and furnace scheduling in small foundries , 2008, Comput. Oper. Res..

[10]  D. Klabjan,et al.  Single machine multi-product capacitated lot sizing with sequence-dependent setups , 2007 .

[11]  Patrizia Beraldi,et al.  Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs , 2008, Comput. Oper. Res..

[12]  John M. Wilson,et al.  The capacitated lot sizing problem: a review of models and algorithms , 2003 .

[13]  Günter Fandel,et al.  Simultaneous lot sizing and scheduling for multi-product multi-level production , 2006 .

[14]  Alistair Clark,et al.  Optimization approximations for capacity constrained material requirements planning , 2003 .

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

[16]  G. Fontan,et al.  MIP-BASED HEURISTICS FOR CAPACITATED LOTSIZING PROBLEMS , 2003 .

[17]  Mingyuan Chen,et al.  A linear programming embedded genetic algorithm for an integrated cell formation and lot sizing considering product quality , 2008, Eur. J. Oper. Res..

[18]  Egon Balas,et al.  Integer Programming , 2021, Encyclopedia of Optimization.

[19]  Alf Kimms,et al.  Multi-level, single-machine lot sizing and scheduling (with initial inventory) , 1996 .