期刊
EXPERT SYSTEMS WITH APPLICATIONS
卷 36, 期 3, 页码 7087-7092出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2008.08.033
关键词
Scheduling; Single-machine; Tardiness; Iterated greedy heuristic
类别
资金
- National Science Council of the Republic of China, Taiwan [NSC 95-2221-E-211-009]
The single-machine tardiness problem with sequence dependent setup times is a core topic for scheduling studies. Tardiness is actually a difficult criterion to deal with, even in a relatively simple manufacturing system, such as a single-machine is strongly NP-hard. Motivated by the computational complexity of this problem, a simple iterated greedy (IG) heuristic is proposed to solve it. To validate and verify the proposed IG heuristic, computational experiments were conducted on three benchmark problem sets that included weighted and un-weighted tardiness problems. The experiment results clearly indicate that the proposed IG heuristic is highly effective as compared to the state-of-the-art meta-heuristics on the same benchmark instances. In terms of both solution quality and computational expense, this study successfully develops an effective and efficient approach for single-machine total tardiness problems with sequence dependent setup times. (C) 2008 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据