期刊
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
卷 53, 期 12, 页码 1374-1379出版社
PALGRAVE PUBLISHERS LTD
DOI: 10.1057/palgrave.jors.2601466
关键词
production scheduling; flow shop sequencing; heuristics
This paper addresses the flow shop sequencing problem. Following an investigation of the problem characteristics, a property of this scheduling problem is presented, and is used for the development of a new constructive heuristic with the objective of minimizing the total time to complete the schedule (makespan). The new method, denoted by N&M, is compared with the best constructive heuristic reported in the literature, named NEH. Results from computational experience have shown that for problems having up to 10 machines and 100 jobs, the new heuristic outperforms, on average, the NEH heuristic. There is no significant difference regarding computation effort for both NEH and NM heuristics.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据