Reentrant two-stage multiprocessor flow shop scheduling with due windows

Reentrant flow shop scheduling allows a job to revisit a particular machine several times. The topic has received considerable interest in recent years; with related studies demonstrating that particle swarm algorithm (PSO) is an effective and efficient means of solving scheduling problems. By selecting a wafer testing process with the due window problem as a case study, this study develops a farness particle swarm optimization algorithm (FPSO) to solve reentrant two-stage multiprocessor flow shop scheduling problems in order to minimize earliness and tardiness. Computational results indicate that either small- or large-scale problems are involved in which FPSO outperforms PSO and ant colony optimization with respect to effectiveness and robustness. Importantly, this study demonstrates that FPSO can solve such a complex scheduling problem efficiently.

[1]  Jacques Desrosiers,et al.  Survey Paper - Time Window Constrained Routing and Scheduling Problems , 1988, Transp. Sci..

[2]  Shengyao Wang,et al.  An effective artificial bee colony algorithm for the flexible job-shop scheduling problem , 2012 .

[3]  Yeu-Ruey Tzeng,et al.  A hybrid EDA with ACS for solving permutation flow shop scheduling , 2012 .

[4]  Jen-Shiang Chen,et al.  Minimizing makespan in reentrant flow-shops using hybrid tabu search , 2007 .

[5]  Yanping Li,et al.  Scheduling of a hub reentrant job shop to minimize makespan , 2011 .

[6]  Hamid Reza Golmakani,et al.  An artificial immune algorithm for multiple-route job shop scheduling problem , 2012 .

[7]  Shanlin Yang,et al.  Minimising makespan for two batch-processing machines with non-identical job sizes in job shop , 2012, Int. J. Syst. Sci..

[8]  Rong-Hwa Huang,et al.  Solving a multi-objective overlapping flow-shop scheduling , 2008 .

[9]  C.-L. Yang,et al.  Parallel machine scheduling with common due windows , 2010, J. Oper. Res. Soc..

[10]  Yi-Chih Hsieh,et al.  A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem , 2013, Int. J. Syst. Sci..

[11]  George L. Vairaktarakis,et al.  Flow Shop Scheduling , 2013 .

[12]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[13]  H. Nagasawa,et al.  Single-machine scheduling for minimizing total cost with identical, asymmetrical earliness and tardiness penalties , 1993 .

[14]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[15]  G.-C. Lee,et al.  A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness , 2004 .

[16]  Dong-Ho Lee,et al.  Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due dates , 2009 .

[17]  Jen-Shiang Chen,et al.  A branch and bound procedure for the reentrant permutation flow-shop scheduling problem , 2006 .

[18]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[19]  Lionel Amodeo,et al.  New multi-objective method to solve reentrant hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[20]  Hyun Joon Shin,et al.  A scheduling algorithm for the reentrant shop: an application in semiconductor manufacture , 2007 .

[21]  Chi-Hyuck Jun,et al.  Performance analysis of re-entrant flow shop with single-job and batch machines using mean value analysis , 2000 .

[22]  Reha Uzsoy,et al.  Decomposition methods for reentrant flow shops with sequence‐dependent setup times , 2000 .

[23]  I. Hamilton Emmons,et al.  Flow Shop Scheduling: Theoretical Results, Algorithms, and Applications , 2012 .

[24]  Suk Joo Bae,et al.  Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm , 2011, Comput. Ind. Eng..