Using Genetic Algorithm in the Multiprocessor Flow Shop to Minimize the Makespan

In this paper, we consider the k-stage multiprocessor flow shop scheduling problem. Our study aims to provide a good approximate solution to this specific problem with the makespan minimization (Cmax) as the objective function. Considering, the success of the genetic algorithms developed for scheduling problems, we apply this metaheuristic to tackle with this problem. We develop a genetic algorithm with a new crossover operator which is a combination between the SJOX crossover operator proposed by Ruiz and Maroto (2006) and the NXO crossover operator proposed by Oguz and Ercan (2005). The design of our genetic algorithm is different compared to the classical structure of the genetic algorithm especially in the encoding of solutions. For the calibration of our metaheuristic's parameters, we conduct several experimental designs. Our algorithm is tested with benchmark problems presented. The results show that the proposed genetic algorithm is an efficient approach for solving the multiprocessor flow shop problem

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

[2]  Jean-Charles Billaut,et al.  Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art , 1999, RAIRO Oper. Res..

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

[4]  Rubén Ruiz,et al.  A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility , 2006, European Journal of Operational Research.

[5]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

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

[7]  Mohamed Haouari,et al.  Heuristic algorithms for the two-stage hybrid flowshop problem , 1997, Oper. Res. Lett..

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

[9]  HANIJANTO SOEWANDI,et al.  Sequencing three-stage flexible flowshops with identical machines to minimize makespan , 2001 .

[10]  Richard J. Linn,et al.  Hybrid flow shop scheduling: a survey , 1999 .

[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]  Jacques Carlier,et al.  An Exact Method for Solving the Multi-Processor Flow-Shop , 2000, RAIRO Oper. Res..

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