An Application Of Effective Genetic Algorithms For Solving Hybrid Flow Shop Scheduling Problems

This paper addresses the Hybrid Flow Shop (HFS) scheduling problems to minimize the makespan value. In recent years, much attention is given to heuristic and search techniques. Genetic algorithms (GAs) are also known as efficient heuristic and search techniques. This paper proposes an efficient genetic algorithm for hybrid flow shop scheduling problems. The proposed algorithm is tested by Carlier and Neron's (2000) benchmark problem from the literature. The computational results indicate that the proposed efficient genetic algorithm approach is effective in terms of reduced total completion time or makespan (Cmax) for HFS problems.

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

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

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

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

[5]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[6]  ZhangWei,et al.  Hybrid flow shop scheduling , 1999 .

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

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

[9]  Tang Li,et al.  A GENETIC DESCENT ALGORITHM FOR HYBRID FLOW SHOP SCHEDULING , 2002 .

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

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

[12]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

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

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

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

[16]  İhsan Kaya,et al.  A new approach to define sample size at attributes control chart in multistage processes: An application in engine piston manufacturing process , 2007 .

[17]  Xi Yu-geng.  Planning and scheduling algorithm based on TOC for complex hybrid flow shop problems , 2005 .

[18]  Weizhen Mao,et al.  On-line Algorithms for Hybrid Flow Shop S heduling , 2003 .

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

[20]  Mitsuo Gen,et al.  Genetic Algorithms & Engineering Optimization , 2000 .

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

[22]  Deng Shengchun.  Evolutionary algorithm for solving multi-objective hybrid flow-shop scheduling problem , 2006 .

[23]  Saul I. Gass,et al.  Erratum to "Cycling in linear programming problems" [Computers and Operations Research 31 (2002) 303-311] , 2006, Comput. Oper. Res..

[24]  Jose A. Ventura,et al.  An application of genetic algorithms to lot-streaming flow shop scheduling , 2002 .

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

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

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

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

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

[30]  Hong Wang,et al.  A new model in designing neural network in optimization: a hybrid neural network approach to machine scheduling , 1998 .

[31]  Ahmet Çelik,et al.  A fuzzy approach to define sample size for attributes control chart in multistage processes: An application in engine valve manufacturing process , 2008, Appl. Soft Comput..

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

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

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

[35]  Liang Zhang,et al.  An effective hybrid genetic algorithm for flow shop scheduling with limited buffers , 2006, Comput. Oper. Res..

[36]  D. Santos,et al.  Global lower bounds for flow shops with multiple processors , 1995 .

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

[38]  Wendong Xiao,et al.  Hybrid flow shop scheduling using genetic algorithms , 2000, Proceedings of the 3rd World Congress on Intelligent Control and Automation (Cat. No.00EX393).