A bi-population EDA for solving the no-idle permutation flow-shop scheduling problem with the total tardiness criterion
暂无分享,去创建一个
[1] Jose M. Framiñan,et al. A review and classification of heuristics for permutation flow-shop scheduling with makespan objective , 2004, J. Oper. Res. Soc..
[2] Yu-Hsiang Chung,et al. Permutation flowshop scheduling to minimize the total tardiness with learning effects , 2013 .
[3] J. A. Lozano,et al. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .
[4] Ye Xu,et al. An effective hybrid EDA-based algorithm for solving multidimensional knapsack problem , 2012, Expert Syst. Appl..
[5] Alain Guinet,et al. A travelling salesman approach to solve the F , 2005, Eur. J. Oper. Res..
[6] Gur Mosheiov,et al. A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time , 2008, Eur. J. Oper. Res..
[7] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[8] D. Pohoryles,et al. Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times , 1982 .
[9] Mehmet Fatih Tasgetiren,et al. A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem , 2013, Comput. Oper. Res..
[10] Alain Guinet,et al. Three stage no-idle flow-shops , 2003 .
[11] Bassem Jarboui,et al. An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems , 2009, Comput. Oper. Res..
[12] Reza Tavakkoli-Moghaddam,et al. Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan , 2010, Knowl. Based Syst..
[13] Chen Fang,et al. An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem , 2012, Comput. Oper. Res..
[14] Uwe Aickelin,et al. An estimation of distribution algorithm for nurse scheduling , 2007, Ann. Oper. Res..
[15] K. R. Baker,et al. An investigation of due-date assignment rules with constrained tightness , 1981 .
[16] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[17] Rubén Ruiz,et al. Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics , 2008, Comput. Oper. Res..
[18] Jerzy Kamburowski,et al. More on three-machine no-idle flow shops , 2004, Comput. Ind. Eng..
[19] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[20] Jung Woo Jung,et al. Flowshop-scheduling problems with makespan criterion: a review , 2005 .
[21] Rubén Ruiz,et al. A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..
[22] Porpan Vachajitpan,et al. Job sequencing with continuous machine operation , 1982 .
[23] Xingsheng Gu,et al. A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion , 2012, Comput. Oper. Res..
[24] Jerzy Kamburowski,et al. A heuristic for minimizing the makespan in no-idle permutation flow shops , 2005, Comput. Ind. Eng..
[25] Quan-Ke Pan,et al. A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion , 2013 .
[26] Quan-Ke Pan,et al. A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems , 2008 .
[27] M. F. Tasgetiren,et al. A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion , 2011 .
[28] Mehmet Mutlu Yenisey,et al. Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends , 2014 .
[29] Margaret J. Robertson,et al. Design and Analysis of Experiments , 2006, Handbook of statistics.
[30] Ling Wang,et al. No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm , 2008 .
[31] Ye Xu,et al. A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem , 2012, Comput. Ind. Eng..