A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion
暂无分享,去创建一个
Mehmet Fatih Tasgetiren | Quan-Ke Pan | Ponnuthurai N. Suganthan | Angela Hsiang-Ling Chen | M. F. Tasgetiren | P. Suganthan | Q. Pan | A. Chen | M. Tasgetiren
[1] C. Rajendran. Heuristic algorithm for scheduling in a flowshop to minimize total flowtime , 1993 .
[2] Mehmet Fatih Tasgetiren,et al. A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2008, Comput. Ind. Eng..
[3] R. Storn,et al. Differential evolution a simple and efficient adaptive scheme for global optimization over continu , 1997 .
[4] Thomas Stützle,et al. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..
[5] Ali Allahverdi,et al. New heuristics to minimize total completion time in m-machine flowshops , 2002 .
[6] Dervis Karaboga,et al. AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .
[7] S. L. Velde. Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation , 1991 .
[8] E. Ignall,et al. Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .
[9] Mehmet Fatih Tasgetiren,et al. A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2007, GECCO '07.
[10] D. Karaboga,et al. On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..
[11] Xiaoping Li,et al. Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization , 2009, Eur. J. Oper. Res..
[12] Mehmet Fatih Tasgetiren,et al. Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem , 2004, ANTS Workshop.
[13] Bassem Jarboui,et al. A combinatorial particle swarm optimisation for solving permutation flowshop problems , 2008, Comput. Ind. Eng..
[14] Lin-Yu Tseng,et al. A hybrid genetic local search algorithm for the permutation flowshop scheduling problem , 2009, Eur. J. Oper. Res..
[15] Mehmet Fatih Tasgetiren,et al. A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem , 2011, Inf. Sci..
[16] Nurhan Karaboga,et al. A new design method based on artificial bee colony algorithm for digital IIR filters , 2009, J. Frankl. Inst..
[17] Mehmet Fatih Tasgetiren,et al. A discrete differential evolution algorithm for single machine total weighted tardiness problem with sequence dependent setup times , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).
[18] Dervis Karaboga,et al. A comparative study of Artificial Bee Colony algorithm , 2009, Appl. Math. Comput..
[19] Dervis Karaboga,et al. A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..
[20] Stanley F. Bullington,et al. An effective heuristic for flow shop problems with total flow time as criterion , 1993 .
[21] J. Framiñan,et al. An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .
[22] Pedro Larrañaga,et al. Towards a New Evolutionary Computation - Advances in the Estimation of Distribution Algorithms , 2006, Towards a New Evolutionary Computation.
[23] Q. Wang,et al. Efficient composite heuristics for total flowtime minimization in permutation flow shops , 2009 .
[24] Jatinder N. D. Gupta,et al. Flowshop scheduling with dominant machines , 1995, Comput. Oper. Res..
[25] Hoon-Shik Woo,et al. A heuristic algorithm for mean flowtime objective in flowshop scheduling , 1998, Comput. Oper. Res..
[26] 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 .
[27] S. Bansal. Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound Approach , 1977 .
[28] Jiyin Liu,et al. Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem , 2001, Eur. J. Oper. Res..
[29] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[30] Bassem Jarboui,et al. An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems , 2009, Comput. Oper. Res..
[31] Mehmet Fatih Tasgetiren,et al. A discrete differential evolution algorithm for single machine total weighted tardiness problem with sequence dependent setup times , 2008, IEEE Congress on Evolutionary Computation.
[32] Ömer Kirca,et al. A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems , 2002 .
[33] C. Rajendran,et al. An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops , 2006 .
[34] 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..
[35] Ping Chen,et al. An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion , 2009, Comput. Oper. Res..
[36] Chandrasekharan Rajendran,et al. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..
[37] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[38] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .