A hybrid genetic algorithm for solving no-wait flowshop scheduling problems

被引：0
|
作者：
Bassem Jarboui
Mansour Eddaly
Patrick Siarry
机构：
[1] FSEGS,LiSSi
[2] Université de Paris 12,undefined
来源：
The International Journal of Advanced Manufacturing Technology | 2011年 / 54卷
关键词：
No-wait flowshop; Genetic algorithm; Variable Neighborhood Search; Makespan;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A hybrid genetic algorithm is proposed in this paper to minimize the makespan and the total flowtime in the no-wait flowshop scheduling problem, which is known to be NP-hard for more than two machines. The Variable Neighborhood Search is used as an improvement procedure in the last step of the genetic algorithm. First, comparisons are provided with respect to several techniques that are representative of the previous works in the area. Then, we compare the results given by three proposed algorithms. For the makespan criterion as well as for the total flowtime, the computational results show that our algorithms are able to provide competitive results and new best upper bounds.
引用
收藏
页码：1129 / 1143
页数：14
相关论文
共 50 条
  • [11] STOCHASTIC FLOWSHOP NO-WAIT SCHEDULING
    FROSTIG, E
    ADIRI, I
    JOURNAL OF APPLIED PROBABILITY, 1985, 22 (01) : 240 - 246
  • [12] Iterative local search algorithm for no-wait flowshop scheduling problems to minimize makespan
    Wang, Chuyang
    Li, Xiaoping
    Wang, Qian
    PROCEEDINGS OF THE 2008 12TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, VOLS I AND II, 2008, : 908 - +
  • [13] New hybrid improved genetic algorithm for solving no-wait flow shop scheduling problem
    Pei X.
    Li Y.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2021, 27 (03): : 815 - 827
  • [14] Improved Exact Methods for Solving No-Wait Flowshop Scheduling Problems With Due Date Constraints
    Ying, Kuo-Ching
    Lu, Chung-Cheng
    Lin, Shih-Wei
    IEEE ACCESS, 2018, 6 : 30702 - 30713
  • [15] Minimizing makespan for solving the distributed no-wait flowshop scheduling problem
    Lin, Shih-Wei
    Ying, Kuo-Ching
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 : 202 - 209
  • [16] 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
  • [17] A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems
    Engin, Orhan
    Guclu, Abdullah
    APPLIED SOFT COMPUTING, 2018, 72 : 166 - 176
  • [18] Minimizing makespan for a no-wait flowshop using genetic algorithm
    Chaudhry, Imran Ali
    Khan, Abdul Munem
    SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2012, 37 (06): : 695 - 707
  • [19] Solving No-Wait Flow Shop Scheduling Problems by a Hybrid Quantum-Inspired Evolutionary Algorithm
    Zheng, Tianmin
    Yamashiro, Mitsuo
    ADVANCES IN SOFT COMPUTING - MICAI 2010, PT II, 2010, 6438 : 315 - 324
  • [20] Minimizing makespan for no-wait flowshop scheduling problems with setup times
    Ying, Kuo-Ching
    Lin, Shih-Wei
    COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 121 : 73 - 81
12345