期刊
EXPERT SYSTEMS WITH APPLICATIONS
卷 94, 期 -, 页码 58-69出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2017.10.050
关键词
Scheduling; Flowshop; Heuristics; PFSP; Tardiness; Beam search; Iterated greedy algorithm; Iterated local search
类别
资金
- Spanish Ministry of Science and Innovation, under project ADDRESS [DPI2013-44461-P]
- Spanish Ministry of Science and Innovation, under project PROMISE [DPI2016-80750-P]
The permutation flow shop scheduling problem is one of the most studied operations research related problems. Literally, hundreds of exact and approximate algorithms have been proposed to optimise several objective functions. In this paper we address the total tardiness criterion, which is aimed towards the satisfaction of customers in a make-to-order scenario. Although several approximate algorithms have been proposed for this problem in the literature, recent contributions for related problems suggest that there is room for improving the current available algorithms. Thus, our contribution is twofold: First, we propose a fast beam-search-based constructive heuristic that estimates the quality of partial sequences without a complete evaluation of their objective function. Second, using this constructive heuristic as initial solution, eight variations of an iterated-greedy-based algorithm are proposed. A comprehensive computational evaluation is performed to establish the efficiency of our proposals against the existing heuristics and metaheuristics for the problem. (C) 2017 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据