An enhanced migrating birds optimization algorithm for no-wait flow shop scheduling problem
暂无分享,去创建一个
[1] Józef Grabowski,et al. Sequencing of jobs in some production system , 2000, Eur. J. Oper. Res..
[2] L. Wang,et al. A DE-based approach to no-wait flow-shop scheduling , 2009, Comput. Ind. Eng..
[3] R. Tavakkoli-Moghaddam,et al. A multi-objective scatter search for a bi-criteria no-wait flow shop scheduling problem , 2008 .
[4] Quan-Ke Pan,et al. A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems , 2009, Comput. Oper. Res..
[5] Quan-Ke Pan,et al. Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization , 2013 .
[6] Ali Allahverdi,et al. New heuristics to minimize total completion time in m-machine flowshops , 2002 .
[7] Uday K. Chakraborty,et al. A constructive heuristic for minimizing makespan in no-wait flow shop scheduling , 2009 .
[8] Quan-Ke Pan,et al. An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion , 2008 .
[9] Edy Bertolissi,et al. Heuristic algorithm for scheduling in the no-wait flow-shop , 2000 .
[10] Chelliah Sriskandarajah,et al. A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..
[11] Q. Wang,et al. Efficient composite heuristics for total flowtime minimization in permutation flow shops , 2009 .
[12] M. F. Tasgetiren,et al. A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion , 2008 .
[13] R. Tavakkoli-Moghaddam,et al. Solving a multi-objective no-wait flow shop scheduling problem with an immune algorithm , 2008 .
[14] Teofilo F. Gonzalez,et al. Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..
[15] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[16] Mitat Uysal,et al. Migrating Birds Optimization: A new metaheuristic approach and its performance on quadratic assignment problem , 2012, Inf. Sci..
[17] Jose M. Framiñan,et al. Comparison of heuristics for flowtime minimisation in permutation flowshops Technical report IO-2003 / 01 Version 0 . 5 Last version : 26 / 07 / 2003 , 2004 .
[18] Chandrasekharan Rajendran,et al. A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .
[19] Tariq A. Aldowaisan. A new heuristic and dominance relations for no-wait flowshops with setups , 2001, Comput. Oper. Res..
[20] Mehmet Fatih Tasgetiren,et al. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..
[21] Han Hoogeveen,et al. Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing , 2000, Eur. J. Oper. Res..
[22] J. Kamburowski,et al. On the NEH heuristic for minimizing the makespan in permutation flow shops , 2007 .
[23] D. Chaudhuri,et al. Heuristic algorithms for continuous flow-shop problem , 1990 .
[24] Stefan Voß,et al. Solving the continuous flow-shop scheduling problem by metaheuristics , 2003, Eur. J. Oper. Res..
[25] Xiaoping Li,et al. Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion , 2010, Eur. J. Oper. Res..
[26] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[27] Quan-Ke Pan,et al. Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion , 2011 .
[28] A. Allahverdi,et al. New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness , 2009 .