期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 46, 期 3, 页码 461-466出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2004.01.008
关键词
scheduling; flow shop; no-idle machines; makespan
Recently in this journal Saadani, Guinet, and Moalla [Comput Ind Engng 44 (2003) 425] considered the NP-hard problem of minimizing the makespan in a three-machine no-idle flow shop. We identify a simple network representation of the makespan that provides a better insight into the problem, reveals a certain anomaly resulting from the no-idle condition, and leads to some dominance relations among the machines under which the problem becomes efficiently solvable. Extensions to m-machine no-idle flow shops are also included. (C) 2004 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据