期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 187, 期 3, 页码 1143-1159出版社
ELSEVIER
DOI: 10.1016/j.ejor.2006.07.029
关键词
Iterated Greedy; flowshop scheduling; sequence dependent setup times; makespan; weighted tardiness; Stochastic local search; metaheuristics
Iterated Greedy (IG) algorithms are based on a very simple principle, are easy to implement and can show excellent performance. In this paper, we propose two new IG algorithms for a complex flowshop problem that results from the consideration of sequence dependent setup times on machines, a characteristic that is often found in industrial settings. The first IG algorithm is a straightforward adaption of the IG principle, while the second incorporates a simple descent local search. Furthermore, we consider two different optimization objectives, the minimization of the maximum completion time or makespan and the minimization of the total weighted tardiness. Extensive experiments and statistical analyses demonstrate that, despite their simplicity, the IG algorithms are new state-of-the-art methods for both objectives. (C) 2006 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据