期刊
INFORMATION SCIENCES
卷 453, 期 -, 页码 408-425出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2018.04.038
关键词
Scheduling; Sequence dependent setup times; Learning and forgetting effects; No-wait flowshop
资金
- National Natural Science Foundation of China [61572127, 61272377]
- Collaborative Innovation Center of Wireless Communications Technology
- Key Natural Science Fund for Colleges and Universities in Jiangsu Province [12KJA630001]
- Spanish Ministry of Economy and Competitiveness(MINECO), under the project SCHEYARD - Optimization of Scheduling Problems in Container Yards [DPI2015-65895-R]
This paper addresses a sequence dependent setup times no-wait flowshop with learning and forgetting effects to minimize total flowtime. This problem is NP-hard and has never been considered before. A position-based learning and forgetting effects model is constructed. Processing times of operations change with the positions of corresponding jobs in a schedule. Objective increment properties are deduced and based on them three accelerated neighbourhood construction heuristics are presented. Because of the simplicity and excellent performance shown in flowshop scheduling problems, an iterated greedy heuristic is proposed. The proposed iterated greedy algorithm is compared with some existing algorithms for related problems on benchmark instances. Comprehensive computational and statistical tests show that the presented method obtains the best performance among the compared methods. (C) 2018 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据