An Iterated Local Search Algorithm for the Two-Machine Flow Shop Problem with Buffers and Constant Processing Times on One Machine
暂无分享,去创建一个
[1] Erhan Kozan,et al. Scheduling a flow-shop with combined buffer conditions , 2009 .
[2] Lixin Tang,et al. A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage , 2005, J. Intell. Manuf..
[3] Bertrand M. T. Lin,et al. A two-machine flowshop problem with processing time-dependent buffer constraints - An application in multimedia presentations , 2009, Comput. Oper. Res..
[4] P. A. Kononova,et al. The variable neighborhood search for the two machine flow shop problem with a passive prefetch , 2013 .
[5] Leslie Pérez Cáceres,et al. The irace package: Iterated racing for automatic algorithm configuration , 2016 .
[6] Yan Jin,et al. A new improved NEH heuristic for permutation flowshop scheduling problems , 2017 .
[7] Ling Wang,et al. An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers , 2008, Comput. Oper. Res..
[8] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[9] Yazid Mati,et al. Complexity of flowshop scheduling problems with a new blocking constraint , 2003, Eur. J. Oper. Res..
[10] Javad Rezaeian,et al. Minimizing makespan for flow shop scheduling problem with intermediate buffers by using hybrid approach of artificial immune system , 2015, Appl. Soft Comput..
[11] Y.-C. Hsieh,et al. A note of using effective immune based approach for the flow shop scheduling with buffers , 2009, Appl. Math. Comput..
[12] Liang Gao,et al. A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers , 2011, Appl. Soft Comput..
[13] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[14] Jose M. Framiñan,et al. New hard benchmark for flowshop scheduling problems minimising makespan , 2015, Eur. J. Oper. Res..
[15] Jacques Carlier,et al. Ordonnancements à contraintes disjonctives , 1978 .
[16] Peter Brucker,et al. Flow-shop problems with intermediate buffers , 2003, OR Spectr..
[17] Najoua Dridi,et al. A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size , 2014, J. Sched..
[18] Gabriela Ochoa,et al. On the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming , 2011, J. Oper. Res. Soc..
[19] Liang Gao,et al. An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers , 2011, Inf. Sci..
[20] Ghasem Moslehi,et al. A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion , 2014, Comput. Oper. Res..
[21] Victor Fernandez-Viagas,et al. NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness , 2015, Comput. Oper. Res..
[22] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[23] Zbigniew Michalewicz,et al. Benchmarking Optimization Algorithms: An Open Source Framework for the Traveling Salesman Problem , 2014, IEEE Computational Intelligence Magazine.
[24] Christos H. Papadimitriou,et al. Flowshop scheduling with limited temporary storage , 1980, JACM.
[25] Quan-ke Pan,et al. An effective invasive weed optimization algorithm for the flow shop scheduling with intermediate buffers , 2013, 2013 25th Chinese Control and Decision Conference (CCDC).
[26] Colin R. Reeves,et al. A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..
[27] Xing-sheng Gu,et al. An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermediate buffers , 2015 .
[28] Yakov Zinder,et al. Permutation schedules for a two-machine flow shop with storage , 2016, Oper. Res. Lett..