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 条
  • [41] Discrete Artificial Bee Colony Algorithm for Multi-objective Distributed Heterogeneous No-wait Flowshop Scheduling Problem
    Li H.
    Gao L.
    Li X.
    Jixie Gongcheng Xuebao/Journal of Mechanical Engineering, 2023, 59 (02): : 291 - 306
  • [42] Upper Bounds on Taillard's Benchmark Suite for the No-Wait Flowshop Scheduling Problem with Makespan Criterion
    Pan, Quan-Ke
    Tasgetiren, Fatih
    Liang, Yun-Chia
    Suganthan, P. N.
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 2955 - +
  • [43] A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion
    Quan-Ke Pan
    Ling Wang
    M. Fatih Tasgetiren
    Bao-Hua Zhao
    The International Journal of Advanced Manufacturing Technology, 2008, 38 : 337 - 347
  • [44] A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion
    Pan, Quan-Ke
    Wang, Ling
    Tasgetiren, M. Fatih
    Zhao, Bao-Hua
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 38 (3-4): : 337 - 347
  • [45] A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion
    Pan, Quan-Ke
    Wang, Ling
    Tasgetiren, M. Fatih
    Zhao, Bao-Hua
    1600, Springer London (38): : 3 - 4
  • [46] No-wait flowshop scheduling problem to minimize the number of tardy jobs
    Tariq A. Aldowaisan
    Ali Allahverdi
    The International Journal of Advanced Manufacturing Technology, 2012, 61 : 311 - 323
  • [47] No-wait flowshop scheduling problem to minimize the number of tardy jobs
    Aldowaisan, Tariq A.
    Allahverdi, Ali
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 61 (1-4): : 311 - 323
  • [48] No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem
    Mucha, Marcin
    Sviridenko, Maxim
    MATHEMATICS OF OPERATIONS RESEARCH, 2016, 41 (01) : 247 - 254
  • [49] Solving Re-entrant No-wait Flowshop Scheduling Problem
    Hassanpour, S. Tasouji
    Amin-Naseri, M. R.
    Nahavandi, N.
    INTERNATIONAL JOURNAL OF ENGINEERING, 2015, 28 (06): : 903 - 912
  • [50] Minimizing makespan for solving the distributed no-wait flowshop scheduling problem
    Lin, Shih-Wei
    Ying, Kuo-Ching
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 : 202 - 209
12345