An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems

The hybrid flow shop scheduling with multiprocessor task (HFSMT) problem is a substantial production scheduling problem for minimizing the makespan, and there exist many difficulties in solving large scale HFSMT problems which include many jobs, machines and tasks. The HFSMT problems known as NP-hard and the proposal of an efficient genetic algorithm (GA) were taken into consideration in this study. The numerical results prove that the computational performance of a GA depends on the factors of initial solution, reproduction, crossover, and mutation operators and probabilities. The implementation details, including a new mutation operator, were described and a full factorial experimental design was determined with our GA program by using the best values of the control parameters and the operators. After a comparison was made with the studies of Oguz [1], Oguz and Ercan [2] and Kahraman et al. [3] related to the HFSMT problems, the computational results indicated that the proposed genetic algorithm approach is very effective in terms of reduced total completion time or makespan (C"m"a"x) for the attempted problems.

[1]  Takeshi Yamada,et al.  A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems , 1992, PPSN.

[2]  Ferdinando Pezzella,et al.  An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem , 2010, Eur. J. Oper. Res..

[3]  Yves Pochet,et al.  A branch-and-bound algorithm for the hybrid flowshop , 2000 .

[4]  Salah E. Elmaghraby,et al.  Sequencing Three-Stage Flexible Flowshops with Identical Machines to Minimize Makespan , 2001 .

[5]  Pei-Chann Chang,et al.  Adaptive multi-objective genetic algorithms for scheduling of drilling operation in printed circuit board industry , 2007, Appl. Soft Comput..

[6]  Antonio Grieco,et al.  Tsp-based scheduling in a batch-wise hybrid flow-shop , 2007 .

[7]  Thomas Bäck,et al.  Evolutionary computation: comments on the history and current state , 1997, IEEE Trans. Evol. Comput..

[8]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[9]  Funda Sivrikaya-Serifoglu,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach , 2004, J. Oper. Res. Soc..

[10]  Abdelhakim Artiba,et al.  Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints , 2004, Comput. Ind. Eng..

[11]  Alper Döyen,et al.  A new approach to solve hybrid flow shop scheduling problems by artificial immune system , 2004, Future Gener. Comput. Syst..

[12]  Fawaz S. Al-Anzi,et al.  Scheduling multi-stage parallel-processor services to minimize average response time , 2006, J. Oper. Res. Soc..

[13]  Philippe Baptiste,et al.  Solving hybrid flow shop problem using energetic reasoning and global operations , 2001 .

[14]  David B. Fogel,et al.  Evolutionary Computation: A New Transactions , 1997, IEEE Trans. Evol. Comput..

[15]  Nirwan Ansari,et al.  A Genetic Algorithm for Multiprocessor Scheduling , 1994, IEEE Trans. Parallel Distributed Syst..

[16]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[17]  Zhihong Jin,et al.  Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem , 2006 .

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

[19]  Ivan Tanev,et al.  Hybrid evolutionary algorithm-based real-world flexible job shop scheduling problem: application service provider approach , 2004, Appl. Soft Comput..

[20]  Ceyda Oguz,et al.  Scheduling multiprocessor tasks in a two-stage flow-shop environment , 1997 .

[21]  Cengiz Kahraman,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach , 2010, Appl. Soft Comput..

[22]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

[23]  Abdelhakim Artiba,et al.  Scheduling two-stage hybrid flow shop with availability constraints , 2006, Comput. Oper. Res..

[24]  Shih-Wei Lin,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach , 2006 .

[25]  Mostafa Zandieh,et al.  An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times , 2006, Appl. Math. Comput..

[26]  Ceyda Oguz,et al.  Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion , 2007 .

[27]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

[28]  Cengiz Kahraman,et al.  An Application Of Effective Genetic Algorithms For Solving Hybrid Flow Shop Scheduling Problems , 2008, Int. J. Comput. Intell. Syst..

[29]  Orhan Engin,et al.  Using ant colony optimization to solve hybrid flow shop scheduling problems , 2007 .

[30]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[31]  Abdelhakim Artiba,et al.  A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan , 1998, Eur. J. Oper. Res..

[32]  Mitsuo Gen,et al.  Genetic Algorithms , 1999, Wiley Encyclopedia of Computer Science and Engineering.

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

[34]  Ceyda Oguz,et al.  Hybrid flow-shop scheduling problems with multiprocessor task systems , 2004, Eur. J. Oper. Res..

[35]  Wenxin Liu,et al.  A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment , 2005, J. Intell. Manuf..

[36]  Ceyda Oguz,et al.  A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks , 2005, J. Sched..

[37]  L. Tang,et al.  Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers , 2006, J. Oper. Res. Soc..

[38]  Jan Karel Lenstra,et al.  PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .

[39]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

[40]  Gupta J.N.D..  TWO-STAGE HYBRID FLOW SHOP SCHEDULING PROBLEM , 1988 .

[41]  T. C. Edwin Cheng,et al.  Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop , 2003, Eur. J. Oper. Res..

[42]  Marie-Claude Portmann,et al.  Branch and bound crossed with GA to solve hybrid flowshops , 1998, Eur. J. Oper. Res..

[43]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .