Iterated reference greedy algorithm for solving distributed no-idle permutation flowshop scheduling problems

被引：78

作者：

Yine, Kuo-Ching ^{[1
]}

Lin, Shih-Wei ^{[2
,3
]}

Cheng, Chen-Yang ^{[1
]}

He, Cheng-Ding ^{[1
]}

机构：

[1] Natl Taipei Univ Technol, Dept Ind Engn & Management, Taipei, Taiwan

[2] Chang Gung Univ, Dept Informat Management, Taoyuan, Taiwan

[3] Linkou Chang Gung Mem Hosp, Dept Neurol, Taoyuan, Taiwan

来源：

COMPUTERS & INDUSTRIAL ENGINEERING | 2017年 / 110卷

关键词：

Scheduling; Distributed permutation flowshop; No-idle; Iterated reference greedy algorithm; TABU SEARCH ALGORITHM; MINIMIZING MAKESPAN; DIFFERENTIAL EVOLUTION; HEURISTICS; CLASSIFICATION; SHOPS; TIMES;

D O I：

10.1016/j.cie.2017.06.025

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper investigates the Distributed No-idle Permutation Flowshop Scheduling Problem (DNIPFSP) with the objective of minimizing the makespan, which has not been discussed in any previous study. This study presents an Iterated Reference Greedy (IRG) algorithm for effectively solving this problem. The performance of the proposed IRG algorithm is compared with a state-of-the-art iterated greedy (IG) algorithm, as well as the Mixed Integer Linear Programming (MILP) model on two well-known benchmark problem sets. Computational results show that the proposed IRG algorithm outperforms the IG algorithm. Given the NP-Complete nature of the DNIPFSP problem, this paper is the first study to contribute a feasible approach for solving it effectively. (C) 2017 Elsevier Ltd. All rights reserved.

引用

页码：413 / 423

页数：11

共 50 条

[1] An Adaptive Iterated Greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems
Li, Yuan-Zhen
Pan, Quan-Ke
Li, Jun-Qing
Gao, Liang
Tasgetiren, M. Fatih
SWARM AND EVOLUTIONARY COMPUTATION, 2021, 63
[2] An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem
Pan, Quan-Ke
Ruiz, Ruben
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2014, 44 : 41 - 50
[3] A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion
Riahi, Vahid
Chiong, Raymond
Zhang, Yuli
COMPUTERS & OPERATIONS RESEARCH, 2020, 117
[4] A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
Tasgetiren, M. Fatih
Pan, Quan-Ke
Suganthan, P. N.
Buyukdagli, Ozge
COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (07) : 1729 - 1743
[5] A referenced iterated greedy algorithm for the distributed assembly mixed no-idle permutation flowshop scheduling problem with the total tardiness criterion
Li, Yuan-Zhen
Pan, Quan-Ke
Ruiz, Ruben
Sang, Hong-Yan
KNOWLEDGE-BASED SYSTEMS, 2022, 239
[6] A DE Based Variable Iterated Greedy Algorithm for the No-Idle Permutation Flowshop Scheduling Problem with Total Flowtime Criterion
Tasgetiren, M. Fatih
Pan, Quan-Ke
Wang, Ling
Chen, Angela H. -L.
ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS: WITH ASPECTS OF ARTIFICIAL INTELLIGENCE, 2012, 6839 : 83 - +
[7] An Iterative Greedy Algorithm With Q-Learning Mechanism for the Multiobjective Distributed No-Idle Permutation Flowshop Scheduling
Zhao F.
Zhuang C.
Wang L.
Dong C.
IEEE Trans. Syst. Man Cybern. Syst., 5 (3207-3219): : 3207 - 3219
[8] An Iterative Greedy Algorithm With Q-Learning Mechanism for the Multiobjective Distributed No-Idle Permutation Flowshop Scheduling
Zhao, Fuqing
Zhuang, Changxue
Wang, Ling
Dong, Chenxin
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2024, 54 (05): : 3207 - 3219
[9] Reinforcement learning iterated greedy algorithm for distributed assembly permutation flowshop scheduling problems
Ying K.-C.
Lin S.-W.
Journal of Ambient Intelligence and Humanized Computing, 2023, 14 (08) : 11123 - 11138
[10] A Q-Learning Evolutionary Algorithm for Solving the Distributed Mixed No-Idle Permutation Flowshop Scheduling Problem
Zeng, Fangchi
Cui, Junjia
SYMMETRY-BASEL, 2025, 17 (02):

← 1 2 3 4 5 →