期刊
COMPUTERS & OPERATIONS RESEARCH
卷 37, 期 12, 页码 2062-2070出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2010.02.006
关键词
Permutation flow shop; Scheduling; Heuristics
类别
资金
- Spanish Ministry of Science and Innovation [DPI2007-61371]
In this paper a three steps heuristic for the permutation flow shop problem is proposed. The objective is to minimize the maximum time for completing the jobs, or the makespan. The first two steps are inspired by the NEH heuristic, to which a new tie breaking strategy has been incorporated in the insertion phase. Furthermore, the reversibility property of the problem dealt with is taken as a tool for improving the obtained solution. The third step consists of an iterated local search procedure with an embedded local search which is a variant of the non exhaustive descent algorithm. The statistical analysis of the results shows the effectiveness of the proposed procedures. (C) 2010 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据