期刊
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
卷 39, 期 3, 页码 293-301出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.omega.2010.07.007
关键词
Flowshop; Blocking; Makespan; Iterated local search
资金
- Spanish Ministry of Science and Innovation [DPI2007-61371]
This paper proposes an iterated greedy algorithm for solving the blocking flowshop scheduling problem for makespan minimization. Moreover, it presents an improved NEH-based heuristic, which is used as the initial solution procedure for the iterated greedy algorithm. The effectiveness of both procedures was tested on some of Taillard's benchmark instances that are considered to be blocking flowshop instances. The experimental evaluation showed the efficiency of the proposed algorithm, in spite of its simple structure, in comparison with a state-of-the-art algorithm. In addition, new best solutions for Taillard's instances are reported for this problem, which can be used as a basis of comparison in future studies. (C) 2010 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据