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
关键词
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 条
  • [21] A constructive heuristic for minimizing makespan in no-wait flow shop scheduling
    Dipak Laha
    Uday K. Chakraborty
    The International Journal of Advanced Manufacturing Technology, 2009, 41 : 97 - 109
  • [22] A constructive heuristic for minimizing makespan in no-wait flow shop scheduling
    Laha, Dipak
    Chakraborty, Uday K.
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 41 (1-2): : 97 - 109
  • [23] An Effective Meta-Heuristic for No-Wait Job Shops to Minimize Makespan
    Zhu, Jie
    Li, Xiaoping
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2012, 9 (01) : 189 - 198
  • [24] MINIMIZING TOTAL TARDINESS IN NO-WAIT FLOWSHOPS
    Aldowaisan, Tariq
    Allahverdi, Ali
    FOUNDATIONS OF COMPUTING AND DECISION SCIENCES, 2012, 37 (03) : 149 - 162
  • [25] Constructive heuristic algorithm for no-wait flow-shop scheduling with objective of makespan
    Hong Zong-you
    Pang Ha-li
    Proceedings of the 2007 Chinese Control and Decision Conference, 2007, : 901 - 904
  • [26] A Metaheuristic for No-wait Flowshops with Variable Processing Times
    Xu, Yi
    Li, Xiaoping
    Shi, Chaomin
    Cui, Mingyu
    Cao, Xincheng
    Ge, Yanyan
    PROCEEDINGS OF THE 2018 IEEE 22ND INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN ((CSCWD)), 2018, : 479 - 484
  • [27] MINIMIZING MAKESPAN IN HYBRID FLOWSHOPS
    LEE, CY
    VAIRAKTARAKIS, GL
    OPERATIONS RESEARCH LETTERS, 1994, 16 (03) : 149 - 158
  • [28] 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,
  • [29] Scheduling and lot streaming in flowshops with no-wait in process
    Hall, NG
    Laporte, G
    Selvarajah, E
    Sriskandarajah, C
    JOURNAL OF SCHEDULING, 2003, 6 (04) : 339 - 354
  • [30] Scheduling and Lot Streaming in Flowshops with No-Wait in Process
    Nicholas G. Hall
    Gilbert Laporte
    Esaignani Selvarajah
    Chelliah Sriskandarajah
    Journal of Scheduling, 2003, 6 : 339 - 354