A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops
暂无分享,去创建一个
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] Mehmet Fatih Tasgetiren,et al. A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2008, Comput. Ind. Eng..
[2] R. Storn,et al. Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .
[3] D. Karaboga,et al. On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..
[4] Chandrasekharan Rajendran,et al. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..
[5] Lin-Yu Tseng,et al. A hybrid genetic local search algorithm for the permutation flowshop scheduling problem , 2009, Eur. J. Oper. Res..
[6] Jatinder N. D. Gupta,et al. Flowshop scheduling with dominant machines , 1995, Comput. Oper. Res..
[7] Wen-Chiung Lee,et al. Some single-machine and m-machine flowshop scheduling problems with learning considerations , 2009, Inf. Sci..
[8] Dervis Karaboga,et al. A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..
[9] Mehmet Fatih Tasgetiren,et al. A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem , 2011, Inf. Sci..
[10] Horst F. Wedde,et al. The wisdom of the hive applied to mobile ad-hoc networks , 2005, Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005..
[11] Nurhan Karaboga,et al. A new design method based on artificial bee colony algorithm for digital IIR filters , 2009, J. Frankl. Inst..
[12] S. L. Velde. Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation , 1991 .
[13] E. Ignall,et al. Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .
[14] 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).
[15] Xiaoping Li,et al. Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization , 2009, Eur. J. Oper. Res..
[16] T. C. Edwin Cheng,et al. Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations , 2009, Inf. Sci..
[17] Mehmet Fatih Tasgetiren,et al. Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem , 2004, ANTS Workshop.
[18] Jiyin Liu,et al. Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem , 2001, Eur. J. Oper. Res..
[19] Stanley F. Bullington,et al. An effective heuristic for flow shop problems with total flow time as criterion , 1993 .
[20] J. Framiñan,et al. An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .
[21] 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 .
[22] Ling Wang,et al. An Effective Hybrid Heuristic for Flow Shop Scheduling , 2003 .
[23] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[24] Q. Wang,et al. Efficient composite heuristics for total flowtime minimization in permutation flow shops , 2009 .
[25] Dehua Xu,et al. Some scheduling problems with general position-dependent and time-dependent learning effects , 2009, Inf. Sci..
[26] Bassem Jarboui,et al. A combinatorial particle swarm optimisation for solving permutation flowshop problems , 2008, Comput. Ind. Eng..
[27] M.A. El-Sharkawi,et al. Swarm intelligence for routing in communication networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).
[28] J. A. Lozano,et al. Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing) , 2006 .
[29] Ömer Kirca,et al. A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems , 2002 .
[30] Mikyung Kang,et al. An energy-efficient real-time scheduling scheme on dual-channel networks , 2008, Inf. Sci..
[31] Lin-Yu Tseng,et al. A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem , 2010 .
[32] Hoon-Shik Woo,et al. A heuristic algorithm for mean flowtime objective in flowshop scheduling , 1998, Comput. Oper. Res..
[33] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[34] Dervis Karaboga,et al. A comparative study of Artificial Bee Colony algorithm , 2009, Appl. Math. Comput..
[35] Mehmet Fatih Tasgetiren,et al. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..
[36] C. Rajendran. Heuristic algorithm for scheduling in a flowshop to minimize total flowtime , 1993 .
[37] Ping Chen,et al. An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion , 2009, Comput. Oper. Res..
[38] S. Bansal. Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound Approach , 1977 .
[39] Dervis Karaboga,et al. A modified Artificial Bee Colony algorithm for real-parameter optimization , 2012, Inf. Sci..
[40] Bassem Jarboui,et al. An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems , 2009, Comput. Oper. Res..
[41] Rainer Storn,et al. Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..
[42] Dervis Karaboga,et al. AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .
[43] Valery Tereshko,et al. Reaction-Diffusion Model of a Honeybee Colony's Foraging Behaviour , 2000, PPSN.
[44] Thomas Stützle,et al. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..
[45] Ali Allahverdi,et al. New heuristics to minimize total completion time in m-machine flowshops , 2002 .
[46] Xin-She Yang,et al. Engineering Optimizations via Nature-Inspired Virtual Bee Algorithms , 2005, IWINAC.
[47] C. Rajendran,et al. An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops , 2006 .
[48] 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..