期刊
EXPERT SYSTEMS WITH APPLICATIONS
卷 37, 期 4, 页码 2848-2852出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2009.09.006
关键词
Dynamic parallel machines scheduling problems; Sequence-dependent setup times; Maximum lateness; Iterated greedy heuristic
类别
资金
- National Science Council of the Republic of China, Taiwan [NSC 98-2221-E-027-117]
Topics related to parallel machine scheduling problems have been of continuing interest for researchers and practitioners. However, the dynamic parallel machine scheduling problem with sequence-dependent setup times still remains under-represented in the research literature. in this study, an iterated greedy heuristic for this problem is presented. Extensive computational experiments reveal that the proposed heuristic is highly effective as compared to state-of-the-art algorithms on the same benchmark problem data set. (C) 2009 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据