Tabu search algorithm for solving No-idle permutation Flow Shop Scheduling Problem
暂无分享,去创建一个
[1] Quan-Ke Pan,et al. A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems , 2008 .
[2] Ling Wang,et al. No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm , 2008 .
[3] Jerzy Kamburowski,et al. A heuristic for minimizing the makespan in no-idle permutation flow shops , 2005, Comput. Ind. Eng..
[4] Rubén Ruiz,et al. A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..
[5] Pierre Hansen,et al. Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..
[6] Ping Chen,et al. An improved NEH-based heuristic for the permutation flowshop problem , 2008, Comput. Oper. Res..
[7] 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..