A new algorithmic approach for capacitated lot-sizing problem in flow shops with sequence-dependent setups

In this paper, we propose a new algorithmic approach to solve the large-sized instances of lot-sizing problem in capacitated pure flow shops with sequence-dependent setups within a reasonable computation time. Two solution algorithms are provided based on a more simplified version of the problem combining the rolling horizon approach with a specific heuristic. To evaluate the effectiveness of the proposed algorithms, some numerical experiments are conducted, and corresponding results are compared with those of previously developed heuristics by the authors. The comparative results indicate the superiority of the second proposed algorithm in solving the large-sized problem instances.

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

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

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

[4]  Ronald G. Askin,et al.  Comparing scheduling rules for flexible flow lines , 2003 .

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

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

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

[8]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

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

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

[11]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

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

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

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

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

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

[17]  Mohammad Mohammadi,et al.  Rolling-horizon and fix-and-relax heuristics for the multi-product multi-level capacitated lotsizing problem with sequence-dependent setups , 2010, J. Intell. Manuf..

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

[19]  Ronald G. Askin,et al.  Scheduling flexible flow lines with sequence-dependent setup times , 2004, Eur. J. Oper. Res..

[20]  Wilbert E. Wilhelm,et al.  Scheduling and lot sizing with sequence-dependent setup: A literature review , 2006 .

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

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

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