期刊
COMPUTERS & OPERATIONS RESEARCH
卷 38, 期 5, 页码 809-815出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2010.09.020
关键词
Parallel machines scheduling problems; Sequence-dependent setup times; Maximum lateness; Iterated greedy heuristic
类别
资金
- National Science Council of the Republic of China (Taiwan) [NSC 99-2628-E-027-003, NSC 99-2410-H-182-023-MY2]
In this paper, we consider an identical parallel machine scheduling problem with sequence-dependent setup times and job release dates. An improved iterated greedy heuristic with a sinking temperature is presented to minimize the maximum lateness. To verify the developed heuristic, computational experiments are conducted on a well-known benchmark problem data set. The experimental results show that the proposed heuristic outperforms the basic iterated greedy heuristic and the state-of-art algorithms on the same benchmark problem data set. It is believed that this improved approach will also be helpful for other applications. (C) 2010 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据