A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion

被引:47
|
作者
Tasgetiren, M. Fatih [1 ]
Pan, Quan-Ke [2 ]
Suganthan, P. N. [3 ]
Chua, Tay Jin [4 ]
机构
[1] Yasar Univ, Dept Ind Engn, Izmir, Turkey
[2] Liaocheng Univ, Coll Comp Sci, Liaocheng 252059, Shandong, Peoples R China
[3] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
[4] Singapore Inst Mfg Technol, Singapore 638075, Singapore
基金
美国国家科学基金会;
关键词
the no-idle permutation flowshop scheduling problem; differential evolution algorithm; random key genetic algorithm; heuristic optimisation; PARTICLE SWARM OPTIMIZATION; MAKESPAN; MACHINE; MINIMIZE; WAIT; SHOPS; TIME;
D O I
10.1080/00207543.2010.497781
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, we investigate the use of a continuous algorithm for the no-idle permutation flowshop scheduling (NIPFS) problem with tardiness criterion. For this purpose, a differential evolution algorithm with variable parameter search (vpsDE) is developed to be compared to a well-known random key genetic algorithm (RKGA) from the literature. The motivation is due to the fact that a continuous DE can be very competitive for the problems where RKGAs are well suited. As an application area, we choose the NIPFS problem with the total tardiness criterion in which there is no literature on it to the best of our knowledge. The NIPFS problem is a variant of the well-known permutation flowshop (PFSP) scheduling problem where idle time is not allowed on machines. In other words, the start time of processing the first job on a given machine must be delayed in order to satisfy the no-idle constraint. The paper presents the following contributions. First of all, a continuous optimisation algorithm is used to solve a combinatorial optimisation problem where some efficient methods of converting a continuous vector to a discrete job permutation and vice versa are presented. These methods are not problem specific and can be employed in any continuous algorithm to tackle the permutation type of optimisation problems. Secondly, a variable parameter search is introduced for the differential evolution algorithm which significantly accelerates the search process for global optimisation and enhances the solution quality. Thirdly, some novel ways of calculating the total tardiness from makespan are introduced for the NIPFS problem. The performance of vpsDE is evaluated against a well-known RKGA from the literature. The computational results show its highly competitive performance when compared to RKGA. It is shown in this paper that the vpsDE performs better than the RKGA, thus providing an alternative solution approach to the literature that the RKGA can be well suited.
引用
收藏
页码:5033 / 5050
页数:18
相关论文
共 50 条
  • [1] A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
    Tasgetiren, M. Fatih
    Pan, Quan-Ke
    Suganthan, P. N.
    Oner, Adalet
    [J]. APPLIED MATHEMATICAL MODELLING, 2013, 37 (10-11) : 6758 - 6779
  • [2] A hybrid discrete water wave optimization algorithm for the no-idle flowshop scheduling problem with total tardiness criterion
    Zhao, Fuqing
    Zhang, Lixin
    Zhang, Yi
    Ma, Weimin
    Zhang, Chuck
    Song, Houbin
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2020, 146
  • [3] A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion
    Riahi, Vahid
    Chiong, Raymond
    Zhang, Yuli
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2020, 117
  • [4] 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
    [J]. KNOWLEDGE-BASED SYSTEMS, 2022, 239
  • [5] 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
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (07) : 1729 - 1743
  • [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.
    [J]. ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS: WITH ASPECTS OF ARTIFICIAL INTELLIGENCE, 2012, 6839 : 83 - +
  • [7] A General Variable Neighborhood Search for the No-Idle Flowshop Scheduling Problem with Makespan Criterion
    Shen, Liangshan
    Tasgetiren, Mehmet Fatih
    Oztop, Hande
    Kandiller, Levent
    Gao, Liang
    [J]. 2019 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI 2019), 2019, : 1684 - 1691
  • [8] Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
    Oztop, Hande
    Tasgetiren, M. Fatih
    Kandiller, Levent
    Pan, Quan-Ke
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2022, 138
  • [9] A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
    Deng, Guanlong
    Gu, Xingsheng
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (09) : 2152 - 2160
  • [10] Algebraic Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem With Total Flowtime Criterion
    Santucci, Valentino
    Baioletti, Marco
    Milani, Alfredo
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (05) : 682 - 694