An effective heuristic algorithm for the partial shop scheduling problem.
Computers & Operations Research(2018)
摘要
•We present an iterated tabu search for the partial shop scheduling problem.•We propose a new constructive heuristic and a neighbourhood with a pruning technique.•We demonstrate that a single algorithm can solve effectively many special cases.•These special cases include group shop, mixed shop, and open shop scheduling.•In experiments the algorithm can compete with all state-of-the-art heuristics.
更多查看译文
关键词
Partial shop scheduling,Mixed shop scheduling,Group shop scheduling,Open shop scheduling,Heuristic,Iterated tabu search
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络