期刊
KNOWLEDGE-BASED SYSTEMS
卷 239, 期 -, 页码 -出版社
ELSEVIER
DOI: 10.1016/j.knosys.2021.108036
关键词
Iterated greedy; Mixed no-idle; Distributed assembly permutation; flowshop scheduling; Total tardiness
资金
- National Science Foundation of China [61973203]
- Spanish Ministry of Science, Innovation, and Universities, under the project OPTEP-Port Terminal Operations Optimization [RTI2018-094940-B-I00]
- FEDER funds
This paper studies the distributed assembly mixed no-idle permutation flowshop scheduling problem (DAMNIPFSP) with the objective of minimizing total tardiness. An improved Iterated Greedy algorithm named RIG (Referenced Iterated Greedy) is proposed, which includes two novel destruction methods, four new reconstruction methods, and six new local search methods based on the characteristics of DAMNIPFSP. Experimental results show that RIG algorithm is a state-of-the-art procedure for DAMNIPFSP with the total tardiness criterion.
In this paper, we study the distributed assembly mixed no-idle permutation flowshop scheduling problem (DAMNIPFSP) with total tardiness objective. We first formulate the problem. Second, based on the characteristics of the DAMNIPFSP, an improved Iterated Greedy algorithm, named RIG (Referenced Iterated Greedy), with two novel destruction methods, four new reconstruction methods and six new local search methods is presented. Among them, two of the reconstruction methods and four of the local search methods are based on a reference, which proves key to performance. Finally, RIG is compared with the related algorithms through experiments. The results show that the new RIG algorithm is a new state-of-the-art procedure for the DAMNIPFSP with the total tardiness criterion. (c) 2021 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据