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 条
  • [21] Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion
    Gao, Kai-zhou
    Pan, Quan-ke
    Li, Jun-qing
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 56 (5-8): : 683 - 692
  • [22] Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion
    Kai-zhou Gao
    Quan-ke Pan
    Jun-qing Li
    The International Journal of Advanced Manufacturing Technology, 2011, 56 : 683 - 692
  • [23] A discrete differential evolution algorithm for the permutation flowshop scheduling problem
    Pan, Quan-Ke
    Tasgetiren, Mehmet Fatih
    Liang, Yun-Chia
    COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 55 (04) : 795 - 816
  • [24] A Discrete Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem
    Pan, Quan-Ke
    Tasgetiren, M. Fatih
    Liang, Yun-Chia
    GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2007, : 126 - +
  • [25] A Discrete Artificial Bee Colony Algorithm for the Energy-Efficient No-Wait Flowshop Scheduling Problem
    Tasgetiren, M. Fatih
    Yuksel, Damla
    Gao, Liang
    Pan, Quan-Ke
    Li, Peigen
    25TH INTERNATIONAL CONFERENCE ON PRODUCTION RESEARCH MANUFACTURING INNOVATION: CYBER PHYSICAL MANUFACTURING, 2019, 39 : 1223 - 1231
  • [26] No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
    Allahverdi, Ali
    Aydilek, Harun
    Aydilek, Asiye
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 269 (02) : 590 - 601
  • [27] Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
    Wang, Chuyang
    Li, Xiaoping
    Wang, Qian
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 206 (01) : 64 - 72
  • [28] SOLVABLE CASES OF THE NO-WAIT FLOWSHOP SCHEDULING PROBLEM
    VANDERVEEN, JAA
    VANDAL, R
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1991, 42 (11) : 971 - 980
  • [29] A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
    RAJENDRAN, C
    CHAUDHURI, D
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1991, 34 (01) : 28 - 46
  • [30] New Greedy Randomized Adaptive Search Procedure based on Differential Evolution algorithm for solving no-wait flowshop scheduling problem
    Akrout, Hanen
    Jarboui, Bassem
    Rebai, Abdelwaheb
    Siarry, Patrick
    2013 INTERNATIONAL CONFERENCE ON ADVANCED LOGISTICS AND TRANSPORT (ICALT), 2013, : 327 - 334
12345