A Genetic algorithm to minimize the makespan in the k-stage hybrid flow shop scheduling problem

[1]  J. Gupta,et al.  Schedules for a two-stage hybrid flowshop with parallel machines at the second stage , 1991 .

[2]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[3]  Jacques Carlier,et al.  An Exact Method for Solving the Multi-Processor Flow-Shop , 2000, RAIRO Oper. Res..

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

[5]  George L. Vairaktarakis,et al.  Minimizing makespan in hybrid flowshops , 1994, Oper. Res. Lett..

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

[7]  Mohamed Haouari,et al.  Optimal Scheduling of a Two-stage Hybrid Flow Shop , 2006, Math. Methods Oper. Res..

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

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

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

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

[12]  M R Amin Naseri,et al.  HYBRID FLOW SHOP SCHEDULING WITH PARALLEL BATCHING , 2009 .

[13]  John L. Hunsucker,et al.  Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment , 1994 .

[14]  Chris N. Potts,et al.  Scheduling a two-stage hybrid flow shop with parallel machines at the first stage , 1997, Ann. Oper. Res..

[15]  P. Lopez,et al.  Climbing depth-bounded discrepancy search for solving hybrid flow shop problems , 2007 .

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

[17]  Jean-Charles Billaut,et al.  Production , Manufacturing and Logistics A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation , 2004 .

[18]  Marius M. Solomon,et al.  A computational study of heuristics for two-stage flexible flowshops , 1996 .

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

[20]  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.

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

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