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 条
  • [1] Genetic Algorithm to minimize flowtime in a no-wait flowshop scheduling problem
    Chaudhry, Imran A.
    Ahmed, Riaz
    Khan, Abdul Munem
    27TH INTERNATIONAL CONFERENCE ON CADCAM, ROBOTICS AND FACTORIES OF THE FUTURE 2014, 2014, 65
  • [2] Algebraic Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem With Total Flowtime Criterion
    Santucci, Valentino
    Baioletti, Marco
    Milani, Alfredo
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (05) : 682 - 694
  • [3] Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling
    Filho, Geraldo Ribeiro
    Nagano, Marcelo Seido
    Lorena, Luiz Antonio Nogueira
    MICAI 2007: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2007, 4827 : 1099 - +
  • [4] Hybrid Genetic-VNS algorithm with total flowtime minimization for the no-wait flowshop problem
    Yang, Ning
    Li, Xiao-Ping
    Zhu, Jie
    Wang, Qian
    PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, : 935 - +
  • [5] A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
    Pan, Quan-Ke
    Tasgetiren, M. Fatih
    Liang, Yun-Chia
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (09) : 2807 - 2839
  • [6] Iterative search method for total flowtime minimization no-wait flowshop problem
    Zhu, Xia
    Li, Xiaoping
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2015, 6 (05) : 747 - 761
  • [7] Iterative search method for total flowtime minimization no-wait flowshop problem
    Xia Zhu
    Xiaoping Li
    International Journal of Machine Learning and Cybernetics, 2015, 6 : 747 - 761
  • [8] A hybrid heuristic algorithm for the no-wait flowshop scheduling problem
    Riahi, Vahid
    Kazemi, Morteza
    CSSE 2015 20th International Symposium on Computer Science and Software Engineering, 2015,
  • [9] A hybrid genetic algorithm for no-wait flowshop scheduling problem
    Tseng, Lin-Yu
    Lin, Ya-Tai
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2010, 128 (01) : 144 - 152
  • [10] A Matheuristic Approach for the No-Wait Flowshop Scheduling Problem with Makespan Criterion
    Gao, Yu
    Wang, Ziyue
    Gao, Liang
    Li, Xinyu
    SYMMETRY-BASEL, 2022, 14 (05):
12345