期刊
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
卷 46, 期 9, 页码 2519-2530出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207540701737997
关键词
heuristic; no-wait flow shop; scheduling; makespan
No-wait or constrained flow shops with makespan minimization are considered in this paper. An Objective Increment method is introduced to judge whether or not a new schedule is better than its parent. The judgment is made just by the makespan increment rather than by the traditional method to compute the whole makespan, and the time complexity of a heuristic can be decreased by one order. As a new schedule is usually generated by insertion or pair wise exchanging, objective increments are analysed for the fundamental operations. A composite heuristic is proposed for the problems considered. Experimental results show that the proposed approach outperforms the best existing algorithms with the least CPU time.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据