An Improved Genetic-Simulated Annealing Algorithm Based on a Hormone Modulation Mechanism for a Flexible Flow-Shop Scheduling Problem

A flexible flow-shop scheduling (FFS) with nonidentical parallel machines for minimizing the maximum completion time or makespan is a well-known combinational problem. Since the problem is known to be strongly NP-hard, optimization can either be the subject of optimization approaches or be implemented for some approximated cases. In this paper, an improved genetic-simulated annealing algorithm (IGAA), which combines genetic algorithm (GA) based on an encoding matrix with simulated annealing algorithm (SAA) based on a hormone modulation mechanism, is proposed to achieve the optimal or near-optimal solution. The novel hybrid algorithm tries to overcome the local optimum and further to explore the solution space. To evaluate the performance of IGAA, computational experiments are conducted and compared with results generated by different algorithms. Experimental results clearly demonstrate that the improved metaheuristic algorithm performs considerably well in terms of solution quality, and it outperforms several other algorithms.

[1]  신종호,et al.  Two-stage hybrid flowshop scheduling problem with a product ratio constraint under dynamic job arrivals = 제품별 구성 비율 제약이 있는 혼합 흐름 공정에서 최대 종료 시간을 최소화하는 스케쥴링 방법 개발 , 2003 .

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

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

[4]  Li-Ning Xing,et al.  A novel mutation operator based on the immunity operation , 2009, Eur. J. Oper. Res..

[5]  Jatinder N. D. Gupta,et al.  Minimizing makespan subject to minimum total flow-time on identical parallel machines , 2000, Eur. J. Oper. Res..

[6]  Guoyong Shi,et al.  A genetic algorithm applied to a classic job-shop scheduling problem , 1997, Int. J. Syst. Sci..

[7]  Manas Ranjan Singh,et al.  A swarm optimization approach for flexible flow shop scheduling with multiprocessor tasks , 2012 .

[8]  Kusum Deep,et al.  A new mutation operator for real coded genetic algorithms , 2007, Appl. Math. Comput..

[9]  Andreas C. Nearchou,et al.  Flow-shop sequencing using hybrid simulated annealing , 2004, J. Intell. Manuf..

[10]  Andreas C. Nearchou,et al.  A novel metaheuristic approach for the flow shop scheduling problem , 2004, Eng. Appl. Artif. Intell..

[11]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[12]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[13]  Mohammad Mehdi Keikha,et al.  Improved Simulated Annealing Using Momentum Terms , 2011, 2011 Second International Conference on Intelligent Systems, Modelling and Simulation.

[14]  Rubén Ruiz,et al.  The hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

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

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

[17]  Leon S Farhy.  Modeling of oscillations in endocrine networks with feedback. , 2004, Methods in enzymology.

[18]  Michael S. Salvador,et al.  A Solution to a Special Class of Flow Shop Scheduling Problems , 1973 .

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

[20]  Jatinder N. D. Gupta,et al.  Heuristics for hybrid flow shops with controllable processing times and assignable due dates , 2002, Comput. Oper. Res..

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

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

[23]  Mostafa Zandieh,et al.  A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times , 2011, J. Intell. Manuf..

[24]  F. Marlow,et al.  Role of the zebrafish trilobite locus in gastrulation movements of convergence and extension , 2000, Genesis.

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

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

[27]  Chelliah Sriskandarajah,et al.  Scheduling algorithms for flexible flowshops: Worst and average case performance , 1988 .

[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]  Orhan Engin,et al.  An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems , 2011, Appl. Soft Comput..

[31]  Maged Dessouky,et al.  MULTISTAGE HYBRID FLOWSHOP SCHEDULING WITH IDENTICAL JOBS AND UNIFORM PARALLEL MACHINES , 1999 .

[32]  Ling Wang,et al.  A Modified Genetic Algorithm for Job Shop Scheduling , 2002 .

[33]  Byung-Cheon Choi,et al.  Two-stage proportionate flexible flow shop to minimize the makespan , 2013, J. Comb. Optim..

[34]  Christos Koulamas,et al.  Flexible flow shop scheduling with uniform parallel machines , 2006, Eur. J. Oper. Res..

[35]  Ching-Fang Liaw,et al.  A tabu search algorithm for the open shop scheduling problem , 1999, Comput. Oper. Res..

[36]  Fuh-Der Chou,et al.  A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan , 2011 .