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 条
  • [31] Minimizing makespan in no-wait job shops
    Bansal, N
    Mahdian, M
    Sviridenko, M
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 2005, 30 (04) : 817 - 831
  • [32] Metaheuristics for Energy-Efficient No-Wait Flowshops: A Trade-off Between Makespan and Total Energy Consumption
    Yuksel, Damla
    Tasgetiren, Mehmet Fatih
    Kandiller, Levent
    Pan, Quan-Ke
    [J]. 2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
  • [33] Ant-colony heuristic algorithm for no-wait flow shop problem with makespan criterion
    School of Information Science and Technology, University of Science and Technology of China, Hefei 230026, China
    不详
    不详
    [J]. Jisuanji Jicheng Zhizao Xitong, 2007, 9 (1801-1804+1815):
  • [34] Some heuristics for no-wait flowshops with total tardiness criterion
    Liu, Gengcheng
    Song, Shiji
    Wu, Cheng
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (02) : 521 - 525
  • [35] Total flowtime in no-wait flowshops with separated setup times
    Aldowaisan, Tariq
    Allahverdi, Ali
    [J]. Computers and Operations Research, 1998, 25 (09): : 757 - 765
  • [36] Accelerated methods for total tardiness minimisation in no-wait flowshops
    Ding, Jianya
    Song, Shiji
    Zhang, Rui
    Gupta, Jatinder N. D.
    Wu, Cheng
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2015, 53 (04) : 1002 - 1018
  • [37] Lotstreaming in no-wait flowshops with one machine never idle
    Wagneur, E
    [J]. PROCEEDINGS OF THE 2001 IEEE INTERNATIONAL CONFERENCE ON CONTROL APPLICATIONS (CCA'01), 2001, : 744 - 749
  • [38] Total flowtime in no-wait flowshops with separated setup times
    Aldowaisan, T
    Allahverdi, A
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1998, 25 (09) : 757 - 765
  • [39] PERFORMANCE OF SCHEDULING ALGORITHMS FOR NO-WAIT FLOWSHOPS WITH PARALLEL MACHINES
    SRISKANDARAJAH, C
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 70 (03) : 365 - 378
  • [40] Hybrid heuristic for total flowtime minimization in no-wait flow shops
    Zhu, Xia
    Li, Xiaoping
    Wang, Qian
    [J]. PROCEEDINGS OF THE 2007 11TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, VOLS 1 AND 2, 2007, : 1050 - +
12345