Simulation Based Priority Rules For Scheduling Of A Flow Shop With Simultaneously Loaded Stations

In this study, a real world flow shop with a transportation restriction is regarded. This restriction reduces the set of feasible schedules even more than the no-buffer restrictions discussed in the literature in the case of limited storage. Since this scheduling problem is integrated in the usual hierarchical planning, the tardiness is minimised. This NP-hard problem is solved by priority rules, because of the addressed dynamic environment (and a high number of jobs) at the company site. Due to the technological restrictions the real duration of a job is significantly larger than its net processing time. By a simulation of the processing time many priority rules are improved and some even significantly. With extensive simulations successful priority rules in the literature are analysed.

[1]  Ram Mohan V. Rachamadugu,et al.  Technical Note - A Note on the Weighted Tardiness Problem , 1987, Oper. Res..

[2]  Thomas E. Morton,et al.  Myopic Heuristics for the Single Machine Weighted Tardiness Problem , 1982 .

[3]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[4]  J. Grabowski,et al.  The permutation flow shop problem with blocking. A tabu search approach , 2007 .

[5]  Stefan Voß,et al.  Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: A real-world application , 2007 .

[6]  Ahmed El-Bouri.  A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop , 2012, Comput. Oper. Res..

[7]  Ling Wang,et al.  Effective heuristics for the blocking flowshop scheduling problem with makespan minimization , 2012 .

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

[9]  Imma Ribas,et al.  An iterated greedy algorithm for the flowshop scheduling problem with blocking , 2011 .

[10]  Sebastian Engell,et al.  Priority rules and predictive control algorithms for on-line scheduling of FMS , 1994 .

[11]  Bernard W. Taylor,et al.  A comparative analysis of the COVERT job sequencing rule using various shop performance measures , 1987 .

[12]  Débora P. Ronconi,et al.  A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking , 2005, Ann. Oper. Res..

[13]  Thomas E. Morton,et al.  Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics , 1993 .

[14]  Chandrasekharan Rajendran,et al.  A comparative study of dispatching rules in dynamic flowshops and jobshops , 1999, Eur. J. Oper. Res..

[15]  Débora P. Ronconi,et al.  Some heuristic algorithms for total tardiness minimization in a flowshop with blocking , 2009 .

[16]  Ari P. J. Vepsalainen.  Priority rules for job shops with weighted tardiness costs , 1987 .

[17]  C. Rajendran,et al.  Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem , 2003 .

[18]  Xianpeng Wang,et al.  A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking , 2012, Appl. Soft Comput..

[19]  T. S. Raghu,et al.  An efficient dynamic dispatching rule for scheduling in a job shop , 1993 .

[20]  Mehmet Fatih Tasgetiren,et al.  A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem , 2011, Comput. Ind. Eng..

[21]  Débora P. Ronconi,et al.  Lower bounding schemes for flowshops with blocking in-process , 2001, J. Oper. Res. Soc..

[22]  Cheng Wang,et al.  A three-phase algorithm for flowshop scheduling with blocking to minimize makespan , 2012, Comput. Oper. Res..

[23]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[24]  Michael Pinedo,et al.  Sequencing in an Assembly Line with Blocking to Minimize Cycle Time , 1989, Oper. Res..

[25]  Débora P. Ronconi,et al.  A note on constructive heuristics for the flowshop problem with blocking , 2004 .