A new heuristic for minimal makespan in no-wait hybrid flowshops

被引：0
|
作者：
Chang, Junlin [1 ]
Ma, Guangfu [2 ]
Ma, Xiaoping [1 ]
机构：
[1] China Univ Min & Technol, Coll Informat & Elect Engn, Xuzhou 221008, Peoples R China
[2] Harbin Inst Technol, Dept Control Sci & Engn, Harbin 150001, Peoples R China
来源：
2006 CHINESE CONTROL CONFERENCE, VOLS 1-5 | 2006年
关键词：
scheduling; hybrid flowshop; no-wait; heuristic;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The no-wait hybrid flowshop scheduling problem is studied to minimize the makespan. This class of problem is characterized by the processing of n jobs through m stages with one or more machines at each stage, and there is no-wait restriction between stages. An integer programming model is first formulated. Then the complete scheduling scheme for a given job sequence is built, and a new heuristic based on the scheduling scheme is proposed. Computational experience demonstrates the effectiveness of the heuristic algorithm in finding near optimal schedules.
引用
收藏
页码：395 / +
页数：2
相关论文
共 50 条
  • [41] 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
  • [42] Hybrid evolutionary algorithm for no-wait flow shops to minimize makespan and total flowtime
    Liao, Xiaoping
    Liu, Yougen
    Li, Xiaoping
    Journal of Southeast University (English Edition), 2008, 24 (04) : 450 - 454
  • [43] Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
    Li XiaoPing
    Cheng, Wu
    SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 2008, 51 (07): : 896 - 909
  • [44] Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
    LI XiaoPing1
    2 Key Laboratory of Computer Network and Information Integration (Southeast University)
    3 Department of Automation
    Science China(Information Sciences), 2008, (07) : 896 - 909
  • [45] Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
    XiaoPing Li
    Cheng Wu
    Science in China Series F: Information Sciences, 2008, 51
  • [46] A new exact algorithm for no-wait job shop problem to minimize makespan
    A. Ozolins
    Operational Research, 2020, 20 : 2333 - 2363
  • [47] A new exact algorithm for no-wait job shop problem to minimize makespan
    Ozolins, A.
    OPERATIONAL RESEARCH, 2020, 20 (04) : 2333 - 2363
  • [48] Improved Beam Search for Optimizing No-Wait Flowshops With Release Times
    Pourhejazy, Pourya
    Lin, Shih-Wei
    Cheng, Chen-Yang
    Ying, Kuo-Ching
    Lin, Pei-Yu
    IEEE ACCESS, 2020, 8 : 148100 - 148124
  • [49] Q-learning guided algorithms for bi-criteria minimization of total flow time and makespan in no-wait permutation flowshops
    Yuksel, Damla
    Kandiller, Levent
    Tasgetiren, Mehmet Fatih
    SWARM AND EVOLUTIONARY COMPUTATION, 2024, 89
  • [50] A heuristic for no-wait flow shop scheduling
    Sagar U. Sapkal
    Dipak Laha
    The International Journal of Advanced Manufacturing Technology, 2013, 68 : 1327 - 1338
12345