No-wait flowshop with separate setup times to minimize maximum lateness

This paper considers the m-machine no-wait flowshop problem with the objective of minimizing the maximum lateness where setup times are considered as separate from processing times and treated as sequence-independent. A dominance relation is developed for the case of three machines and several heuristics and four new effective and efficient genetic algorithms are proposed. The genetic algorithms make use of advanced concepts like steady-state and elitist generational scheme as well as new fast-selection operators. Extensive experimentation is conducted to evaluate the performance of the dominance rule, the proposed heuristics, and the genetic algorithms. The computational and statistical analyses by means of experimental designs show that the genetic algorithms provide better results than the existing literature under the same conditions. Additionally, the proposed dominance rule shows great potential for instances where the processing and setup times are tightly distributed.

[1]  Ammar Oulamara,et al.  Two-Machine No-Wait Flowshop Scheduling Problem to Minimize Maximum Lateness with Separate Setup and Removal Times , 2004 .

[2]  Hans Röck,et al.  Some new results in flow shop scheduling , 1984, Z. Oper. Research.

[3]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[4]  Bo Chen,et al.  A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times , 1993, SIAM J. Comput..

[5]  Tariq A. Aldowaisan.  A new heuristic and dominance relations for no-wait flowshops with setups , 2001, Comput. Oper. Res..

[6]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

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

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

[9]  Jatinder N. D. Gupta,et al.  Two-stage no-wait scheduling models with setup and removal times separated , 1997, Comput. Oper. Res..

[10]  Ali Allahverdi,et al.  Total flowtime in no-wait flowshops with separated setup times , 1998, Comput. Oper. Res..

[11]  L. Darrell Whitley,et al.  Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance , 2002, INFORMS J. Comput..

[12]  Ronald G. McGarvey,et al.  Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated , 2004, J. Oper. Res. Soc..

[13]  Rubén Ruiz,et al.  Some effective heuristics for no-wait flowshops with setup times to minimize total completion time , 2007, Ann. Oper. Res..

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

[15]  Rubén Ruiz,et al.  TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .

[16]  Michel Gendreau,et al.  A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times , 1996 .

[17]  Ali Allahverdi,et al.  Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times , 2001, J. Oper. Res. Soc..

[18]  Chelliah Sriskandarajah,et al.  A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups , 2000, Oper. Res. Lett..

[19]  John L. Bruno,et al.  Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs , 1978, SIAM J. Comput..

[20]  Parthasarati Dileepan.  A note on minimizing maximum lateness in a two-machine no-wait flowshop , 2004, Comput. Oper. Res..

[21]  Reha Uzsoy,et al.  Production scheduling algorithms for a semiconductor test facility , 1991 .

[22]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[23]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[24]  Rubén Ruiz,et al.  Stochastic Local Search: Foundations and Applications, Holger H. Hoos, Thomas Stützle. Morgan Kaufmann Publishers (2005) , 2006 .

[25]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[26]  Tariq A. Aldowaisan,et al.  No-wait and separate setup three-machine flowshop with total completion time criterion , 2000 .

[27]  Clyde L. Monma,et al.  On the Complexity of Scheduling with Batch Setup Times , 1989, Oper. Res..

[28]  Bertrand M. T. Lin,et al.  Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time , 2004, Comput. Ind. Eng..