A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems

Abstract This paper proposes an effective new hybrid ant colony algorithm based on crossover and mutation mechanism for no-wait flow shop scheduling with the criterion to minimize the maximum completion time. The no-wait flow shop is known as a typical NP-hard combinational optimization problem. The hybrid ant colony algorithm is applied to the 192 benchmark instances from literature in order to minimize makespan. The performance of the proposed Hybrid Ant Colony algorithm is compared to the Adaptive Learning Approach and Genetic Heuristic algorithm which are used in previous studies to solve the same set of benchmark problems. The computational experiments show that the proposed Hybrid Ant Colony algorithm provides better results relative to the other algorithms.

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

[2]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[3]  L. Wang,et al.  A DE-based approach to no-wait flow-shop scheduling , 2009, Comput. Ind. Eng..

[4]  Maurice Bonney,et al.  Solutions to the Constrained Flowshop Sequencing Problem , 1976 .

[5]  Chandrasekharan Rajendran,et al.  Two ant-colony algorithms for minimizing total flowtime in permutation flowshops , 2005, Comput. Ind. Eng..

[6]  Bertrand M. T. Lin,et al.  Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time , 2004, Comput. Ind. Eng..

[7]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

[8]  Orhan Engin,et al.  An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems , 2011, Appl. Soft Comput..

[9]  Nicolas Monmarché,et al.  An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem , 2002, Eur. J. Oper. Res..

[10]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

[11]  M. F. Tasgetiren,et al.  A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion , 2008 .

[12]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

[13]  Yash P. Aneja,et al.  Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic , 2011, Comput. Oper. Res..

[14]  Orhan Engin,et al.  Investigation of Ant System parameter interactions by using design of experiments for job-shop scheduling problems , 2009, Comput. Ind. Eng..

[15]  Chandrasekharan Rajendran,et al.  A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .

[16]  Tariq A. Aldowaisan.  A new heuristic and dominance relations for no-wait flowshops with setups , 2001, Comput. Oper. Res..

[17]  Abdelhakim AitZai,et al.  Branch-and-bound and PSO algorithms for no-wait job shop scheduling , 2016, J. Intell. Manuf..

[18]  Ling Wang,et al.  An effective hybrid particle swarm optimization for no-wait flow shop scheduling , 2007 .

[19]  İ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 .

[20]  Gunar E. Liepins,et al.  Genetic algorithms: Foundations and applications , 1990 .

[21]  S. Meeran,et al.  A hybrid genetic tabu search algorithm for solving job shop scheduling problems: a case study , 2011, Journal of Intelligent Manufacturing.

[22]  Bertrand M. T. Lin,et al.  Development of new features of ant colony optimization for flowshop scheduling , 2008 .

[23]  Tarek Y. ElMekkawy,et al.  A genetic algorithm and particle swarm optimization for no-wait flow shop problem with separable setup times and makespan criterion , 2012 .

[24]  Ming Liu,et al.  A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem , 2013, Comput. Oper. Res..

[25]  Shijin Wang,et al.  A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling , 2015 .

[26]  Jingan Yang,et al.  An improved ant colony optimization algorithm for solving a complex combinatorial optimization problem , 2010, Appl. Soft Comput..

[27]  Ching-Jong Liao,et al.  An ant colony system for permutation flow-shop sequencing , 2004, Comput. Oper. Res..

[28]  Ching-Fang Liaw,et al.  An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops , 2008, Comput. Oper. Res..

[29]  Manuel López-Ibáñez,et al.  The travelling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization , 2013, Appl. Soft Comput..

[30]  Ali Allahverdi,et al.  New heuristics for no-wait flowshops to minimize makespan , 2003, Comput. Oper. Res..

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

[32]  C. Rajendran,et al.  An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops , 2006 .

[33]  Mitsuo Gen,et al.  Network modeling and evolutionary optimization for scheduling in manufacturing , 2012, J. Intell. Manuf..

[34]  Uday K. Chakraborty,et al.  A constructive heuristic for minimizing makespan in no-wait flow shop scheduling , 2009 .

[35]  IMRAN ALI CHAUDHRY,et al.  Minimizing makespan for a no-wait flowshop using genetic algorithm , 2012, Sadhana.

[36]  Voratas Kachitvichyanukul,et al.  Multiple colony ant algorithm for job-shop scheduling problem , 2008 .

[37]  Ali Allahverdi,et al.  A survey of scheduling problems with no-wait in process , 2016, Eur. J. Oper. Res..

[38]  Chuen-Lung Chen,et al.  An application of genetic algorithms for flow shop problems , 1995 .

[39]  Ali Allahverdi,et al.  Total completion time with makespan constraint in no-wait flowshops with setup times , 2014, Eur. J. Oper. Res..

[40]  Christian Blum,et al.  ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification , 2002, Ant Algorithms.

[41]  Matteo Fischetti,et al.  The Delivery Man Problem and Cumulative Matroids , 1993, Oper. Res..

[42]  Dunwei Gong,et al.  A Heuristic Genetic Algorithm for No-Wait Flowshop Scheduling Problem , 2007 .

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

[44]  Orhan Engin,et al.  An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan , 2011, Int. J. Comput. Intell. Syst..

[45]  Kuo-Ching Ying,et al.  Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics , 2016 .

[46]  A. S. Spachis,et al.  Heuristics for flow-shop scheduling , 1980 .

[47]  Raymond Chiong,et al.  An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem , 2015, Appl. Soft Comput..

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

[49]  C. Rajendran,et al.  Heuristic algorithms for scheduling in the no-wait flowshop , 1993 .

[50]  Marcelo Seido Nagano,et al.  An evolutionary clustering search for the no-wait flow shop problem with sequence dependent setup times , 2014, Expert Syst. Appl..

[51]  Lin-Yu Tseng,et al.  A hybrid genetic algorithm for no-wait flowshop scheduling problem , 2010 .

[52]  Dexian Huang,et al.  Multi-objective no-wait flow-shop scheduling with a memetic algorithm based on differential evolution , 2009, Soft Comput..

[53]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[54]  Ghaith Rabadi,et al.  A two-stage Ant Colony optimization algorithm to minimize the makespan on unrelated parallel machines—part II: enhancements and experimentations , 2014, J. Intell. Manuf..

[55]  H. Ishibuchi,et al.  Multi-objective genetic algorithm and its applications to flowshop scheduling , 1996 .

[56]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..

[57]  F. Pettersson,et al.  Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem , 2007, Appl. Math. Comput..

[58]  Józef Grabowski,et al.  Some local search algorithms for no-wait flow-shop problem with makespan criterion , 2005, Comput. Oper. Res..

[59]  Mehmet Mutlu Yenisey,et al.  Ant colony optimization for multi-objective flow shop scheduling problem , 2008, Comput. Ind. Eng..

[60]  Quan-Ke Pan,et al.  An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion , 2008 .