A discrete differential evolution algorithm for the no-wait flowshop scheduling problem with total flowtime criterion

被引：35
|
作者：
Tasgetiren, M. Fatih [1 ]
Pan, Quan-Ke [2 ]
Suganthan, P. N. [3 ]
Liang, Yun-Chia [4 ]
机构：
[1] Sultan Qaboos Univ, Dept Operat Management & Business Stat, POB 20,Al Khod 123, Muscat, Oman
[2] Liaocheng Univ, Coll Comp Sci, Liaocheng 252059, Shandong, Peoples R China
[3] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
[4] Yuan Ze Univ, Dept Ind Engn & Management, Taoyuan, Taiwan
来源：
2007 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN SCHEDULING | 2007年
关键词：
D O I：
10.1109/SCIS.2007.367698
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, a discrete differential evolution (DDE) algorithm is presented to solve the no-wait flowshop scheduling problem with the total flowtime criterion. The DDE algorithm is hybridized with the variable neighborhood descent (VND) algorithm to solve the well-known benchmark suites in the literature. The DDE algorithm is applied to the 110 benchmark instances of Taillard [1] by treating them as the no-wait flowshop problem instances with the total flowtime criterion. The solution quality is evaluated with optimal solutions, lower bounds and best known solutions provided by Fink & Vo beta [2]. The computational results show that the DDE algorithm generated better results than those in Fink & Vo beta [2].
引用
收藏
页码：251 / +
页数：3
相关论文
共 50 条
  • [31] AN ORTHOGONAL GENETIC ALGORITHM WITH TOTAL FLOWTIME MINIMIZATION FOR THE NO-WAIT FLOW SHOP PROBLEM
    Liao, Xiao-Ping
    PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-6, 2009, : 1706 - 1711
  • [32] Discrete differential evolution algorithm for distributed blocking flowshop scheduling with makespan criterion
    Zhang, Guanghui
    Xing, Keyi
    Cao, Feng
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2018, 76 : 96 - 107
  • [33] An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
    Nagano, Marcelo Seido
    de Almeida, Fernando Siqueira
    Miyata, Hugo Hissashi
    ENGINEERING OPTIMIZATION, 2021, 53 (08) : 1431 - 1449
  • [34] A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion
    Tasgetiren, Mehmet Fatih
    Pan, Quan-Ke
    Kizilay, Damla
    Gao, Kaizhou
    ALGORITHMS, 2016, 9 (04):
  • [35] An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
    Dong, Xingye
    Huang, Houkuan
    Chen, Ping
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (05) : 1664 - 1669
  • [36] STOCHASTIC FLOWSHOP NO-WAIT SCHEDULING
    FROSTIG, E
    ADIRI, I
    JOURNAL OF APPLIED PROBABILITY, 1985, 22 (01) : 240 - 246
  • [37] An effective iterated local search algorithm for the distributed no-wait flowshop scheduling problem
    Avci, Mustafa
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 120
  • [38] A New Constructive Heuristic for the No-Wait Flowshop Scheduling Problem
    Mousin, Lucien
    Kessaci, Marie-Eleonore
    Dhaenens, Clarisse
    LEARNING AND INTELLIGENT OPTIMIZATION (LION 11 2017), 2017, 10556 : 196 - 209
  • [39] An Improved Particle Swarm Optimization for Permutation Flowshop Scheduling Problem with Total Flowtime Criterion
    Wang, Xianpeng
    Tang, Lixin
    ADVANCES IN SWARM INTELLIGENCE, PT 1, PROCEEDINGS, 2010, 6145 : 144 - 151
  • [40] HEURISTIC ALGORITHM FOR SCHEDULING IN A FLOWSHOP TO MINIMIZE TOTAL FLOWTIME
    RAJENDRAN, C
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1993, 29 (01) : 65 - 73
12345