Solution for flow shop scheduling problems using chaotic hybrid firefly and particle swarm optimization algorithm with improved local search

[1]  Pei-Chann Chang,et al.  Extended artificial chromosomes genetic algorithm for permutation flowshop scheduling problems , 2012, Comput. Ind. Eng..

[2]  Wei-Hsiu Huang,et al.  A block mining and re-combination enhanced genetic algorithm for the permutation flowshop scheduling problem , 2013 .

[3]  Chung-Yee Lee,et al.  Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem , 1993 .

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

[5]  Meikang Qiu,et al.  The Effects of Using Chaotic Map on Improving the Performance of Multiobjective Evolutionary Algorithms , 2014 .

[6]  Ling Wang,et al.  An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers , 2008, Comput. Oper. Res..

[7]  Marcus Ritt,et al.  Fast heuristics for minimizing the makespan in non-permutation flow shops , 2018, Comput. Oper. Res..

[8]  Xingsheng Gu,et al.  A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan ☆ , 2008 .

[9]  Jindong Zhang,et al.  The circular discrete particle swarm optimization algorithm for flow shop scheduling problem , 2010, Expert Syst. Appl..

[10]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[11]  Seyed Jafar Sadjadi,et al.  An Ant Colony Algorithm for the Flowshop Scheduling Problem , 2008 .

[12]  Ching-Jong Liao,et al.  Ant colony optimization combined with taboo search for the job shop scheduling problem , 2008, Comput. Oper. Res..

[13]  Bo Liu,et al.  An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[14]  Rubén Ruiz,et al.  New high performing heuristics for minimizing makespan in permutation flowshops , 2009 .

[15]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[16]  A. Gandomi,et al.  Mixed variable structural optimization using Firefly Algorithm , 2011 .

[17]  Ping Chen,et al.  An improved NEH-based heuristic for the permutation flowshop problem , 2008, Comput. Oper. Res..

[18]  Ying Liu,et al.  An effective differential evolution algorithm for permutation flow shop scheduling problem , 2014, Appl. Math. Comput..

[19]  Andrew Lewis,et al.  Biogeography-based optimisation with chaos , 2014, Neural Computing and Applications.

[20]  Minghao Yin,et al.  A discrete artificial bee colony algorithm with composite mutation strategies for permutation flow shop scheduling problem , 2012 .

[21]  Quan-Ke Pan,et al.  Iterated Greedy methods for the distributed permutation flowshop scheduling problem , 2019, Omega.

[22]  Dechang Pi,et al.  A self-guided differential evolution with neighborhood search for permutation flow shop scheduling , 2016, Expert Syst. Appl..

[23]  Javad Rezaeian,et al.  Minimizing makespan for flow shop scheduling problem with intermediate buffers by using hybrid approach of artificial immune system , 2015, Appl. Soft Comput..

[24]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[25]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[26]  Mariappan Kadarkarainadar Marichelvam,et al.  An improved hybrid Cuckoo Search (IHCS) metaheuristics algorithm for permutation flow shop scheduling problems , 2012, Int. J. Bio Inspired Comput..

[27]  Fardin Ahmadizar,et al.  A new ant colony algorithm for makespan minimization in permutation flow shops , 2012, Comput. Ind. Eng..

[28]  Peigen Li,et al.  A very fast TS/SA algorithm for the job shop scheduling problem , 2008, Comput. Oper. Res..

[29]  Rubén Ruiz,et al.  TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .

[30]  Rubén Ruiz,et al.  Cooperative metaheuristics for the permutation flowshop scheduling problem , 2009, Eur. J. Oper. Res..

[31]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[32]  Vijay Kumar,et al.  A Systematic Review on Firefly Algorithm: Past, Present, and Future , 2020, Archives of Computational Methods in Engineering.

[33]  Marcelo Seido Nagano,et al.  A Constructive Genetic Algorithm for Permutation Flowshop Scheduling Version 2 , 2007 .

[34]  Dragan Vasiljevic,et al.  Handling ties in heuristics for the permutation flow shop scheduling problem , 2015 .

[35]  Richard A. Dudek,et al.  Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines , 1964 .

[36]  Jerzy Kamburowski,et al.  An empirical analysis of the optimality rate of flow shop heuristics , 2009, Eur. J. Oper. Res..

[37]  Yun-Chia Liang,et al.  Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem , 2006 .

[38]  Yang Yang,et al.  QCs scheduling scheme of genetic algorithm (GA) and improved firefly algorithm (FA) , 2019, Cluster Computing.

[39]  Yan-Feng Liu,et al.  A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem , 2013, Appl. Soft Comput..

[40]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

[41]  Jatinder N. D. Gupta,et al.  A Functional Heuristic Algorithm for the Flowshop Scheduling Problem , 1971 .

[42]  Minghao Yin,et al.  A hybrid cuckoo search via Lévy flights for the permutation flow shop scheduling problem , 2013 .

[43]  Ling Wang,et al.  A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation , 2014 .

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

[45]  L. Shyamala,et al.  Cost-effective workflow scheduling approach on cloud under deadline constraint using firefly algorithm , 2020, Applied Intelligence.

[46]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[47]  Ibrahim Berkan Aydilek.  A hybrid firefly and particle swarm optimization algorithm for computationally expensive numerical problems , 2018, Appl. Soft Comput..

[48]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[49]  Eugeniusz Nowicki,et al.  Some aspects of scatter search in the flow-shop problem , 2006, Eur. J. Oper. Res..

[50]  Zaifang Zhang,et al.  Solving the two-stage hybrid flow shop scheduling problem based on mutant firefly algorithm , 2018, J. Ambient Intell. Humaniz. Comput..

[51]  Liang Gao,et al.  An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers , 2011, Inf. Sci..

[52]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[53]  Andreas C. Nearchou,et al.  The effect of various operators on the genetic search for large scheduling problems , 2004 .

[54]  Jairo R. Montoya-Torres,et al.  Flow-shop scheduling problem under uncertainties: Review and trends , 2017 .

[55]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2008, Comput. Ind. Eng..

[56]  Mieczysław Wodecki,et al.  A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

[57]  Liang Gao,et al.  A hybrid backtracking search algorithm for permutation flow-shop scheduling problem minimizing makespan and energy consumption , 2015, 2017 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM).

[58]  K. Vinayagar,et al.  Enhancing performance of cell formation problem using hybrid efficient swarm optimization , 2020, Soft Comput..

[59]  Burak Eksioglu,et al.  A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods , 2008, Comput. Ind. Eng..

[60]  Hui Wang,et al.  A new cuckoo search algorithm with hybrid strategies for flow shop scheduling problems , 2016, Soft Computing.

[61]  Dantong Ouyang,et al.  A hybrid alternate two phases particle swarm optimization algorithm for flow shop scheduling problem , 2010, Comput. Ind. Eng..

[62]  Arun Kumar Sangaiah,et al.  An enhancement of task scheduling in cloud computing based on imperialist competitive algorithm and firefly algorithm , 2019, The Journal of Supercomputing.

[63]  Xiangtao Li,et al.  An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure , 2013, Adv. Eng. Softw..

[64]  Y.-C. Hsieh,et al.  A note of using effective immune based approach for the flow shop scheduling with buffers , 2009, Appl. Math. Comput..