Effective hybrid discrete artificial bee colony algorithms for the total flowtime minimization in the blocking flowshop problem
暂无分享,去创建一个
Jing J. Liang | Jun-qing Li | Q. Pan | Yu-yan Han | Hongyan Sang | N. N. Cao | J. J. Liang | Jing Liang
[1] Richard S. H. Mah,et al. An implicit enumeration scheme for the flowshop problem with no intermediate storage , 1981 .
[2] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[3] Michael Pinedo,et al. Sequencing in an Assembly Line with Blocking to Minimize Cycle Time , 1989, Oper. Res..
[4] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[5] Rainer Leisten,et al. Flowshop sequencing problems with limited buffer storage , 1990 .
[6] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[7] H. Mühlenbein,et al. From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.
[8] Rainer Storn,et al. Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..
[9] R. Storn,et al. Differential evolution a simple and efficient adaptive scheme for global optimization over continu , 1997 .
[10] Józef Grabowski,et al. Sequencing of jobs in some production system , 2000, Eur. J. Oper. Res..
[11] Jiyin Liu,et al. Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem , 2001, Eur. J. Oper. Res..
[12] J. A. Lozano,et al. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .
[13] Débora P. Ronconi,et al. Lower bounding schemes for flowshops with blocking in-process , 2001, J. Oper. Res. Soc..
[14] Tapan P. Bagchi,et al. Minimizing makespan in a blocking flowshop using genetic algorithms , 2001 .
[15] Pedro Larrañaga,et al. Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.
[16] Roberto Tadei,et al. An improved branch-and-bound algorithm for the two machine total completion time flow shop problem , 2002, Eur. J. Oper. Res..
[17] Ling Wang,et al. An Effective Hybrid Heuristic for Flow Shop Scheduling , 2003 .
[18] J. Framiñan,et al. An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .
[19] Débora P. Ronconi,et al. A note on constructive heuristics for the flowshop problem with blocking , 2004 .
[20] Qingfu Zhang,et al. DE/EDA: A new evolutionary algorithm for global optimization , 2005, Inf. Sci..
[21] Dervis Karaboga,et al. AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .
[22] Saul I. Gass,et al. Erratum to "Cycling in linear programming problems" [Computers and Operations Research 31 (2002) 303-311] , 2006, Comput. Oper. Res..
[23] Uwe Aickelin,et al. An estimation of distribution algorithm for nurse scheduling , 2007, Ann. Oper. Res..
[24] Dervis Karaboga,et al. A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..
[25] Jing Liu,et al. A survey of scheduling problems with setup times or costs , 2008, Eur. J. Oper. Res..
[26] D. Karaboga,et al. On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..
[27] Mehmet Fatih Tasgetiren,et al. A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2008, Comput. Ind. Eng..
[28] Marcelo Seido Nagano,et al. A Constructive Genetic Algorithm for Permutation Flowshop Scheduling Version 2 , 2007 .
[29] Dervis Karaboga,et al. A comparative study of Artificial Bee Colony algorithm , 2009, Appl. Math. Comput..
[30] Subhash C. Sarin,et al. A heuristic to minimize total flow time in permutation flow shop , 2009 .
[31] Q. Wang,et al. Efficient composite heuristics for total flowtime minimization in permutation flow shops , 2009 .
[32] Bassem Jarboui,et al. An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems , 2009, Comput. Oper. Res..
[33] Mehmet Fatih Tasgetiren,et al. Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms , 2010, Expert Syst. Appl..
[34] Ponnuthurai N. Suganthan,et al. A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems , 2010, Comput. Oper. Res..
[35] Lixin Tang,et al. A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times , 2010, Comput. Oper. Res..
[36] Quan-Ke Pan,et al. Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems , 2011 .
[37] Mehmet Fatih Tasgetiren,et al. A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem , 2011, Inf. Sci..
[38] Imma Ribas,et al. An iterated greedy algorithm for the flowshop scheduling problem with blocking , 2011 .
[39] Dervis Karaboga,et al. A modified Artificial Bee Colony algorithm for real-parameter optimization , 2012, Inf. Sci..
[40] Quan-Ke Pan,et al. An improved artificial bee colony algorithm for the blocking flowshop scheduling problem , 2012 .
[41] Quan-Ke Pan,et al. An estimation of distribution algorithm for lot-streaming flow shop problems with setup times , 2012 .