Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
388646 | Expert Systems with Applications | 2010 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Kuo-Ching Ying, Hui-Miao Cheng,