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 条
  • [1] New heuristics for no-wait flowshops to minimize makespan
    Aldowaisan, T
    Allahverdi, A
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (08) : 1219 - 1231
  • [2] No-wait flowshops with bicriteria of makespan and maximum lateness
    Allahverdi, A
    Aldowaisan, T
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 152 (01) : 132 - 147
  • [3] A new heuristic and dominance relations for no-wait flowshops with setups
    Aldowaisan, T
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (06) : 563 - 584
  • [4] No-wait flowshops with bicriteria of makespan and total completion time
    Allahverdi, A
    Aldowaisan, T
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (09) : 1004 - 1015
  • [5] Heuristics for no-wait flowshops with makespan subject to mean completion time
    Aydilek, Harun
    Allahverdi, Ali
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2012, 219 (01) : 351 - 359
  • [6] Algorithms for no-wait flowshops with total completion time subject to makespan
    Ali Allahverdi
    Harun Aydilek
    [J]. The International Journal of Advanced Manufacturing Technology, 2013, 68 : 2237 - 2251
  • [7] Algorithms for no-wait flowshops with total completion time subject to makespan
    Allahverdi, Ali
    Aydilek, Harun
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 68 (9-12): : 2237 - 2251
  • [8] An efficient heuristic for total flowtime minimisation in no-wait flowshops
    Framinan, Jose Manuel
    Nagano, Marcelo Seido
    Moccellin, Joao Vitor
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 46 (9-12): : 1049 - 1057
  • [9] An efficient heuristic for total flowtime minimisation in no-wait flowshops
    José Manuel Framinan
    Marcelo Seido Nagano
    João Vitor Moccellin
    [J]. The International Journal of Advanced Manufacturing Technology, 2010, 46 : 1049 - 1057
  • [10] A NO-WAIT FLOWSHOP SCHEDULING HEURISTIC TO MINIMIZE MAKESPAN
    RAJENDRAN, C
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1994, 45 (04) : 472 - 478
12345