A new heuristic and dominance relations for no-wait flowshops with setups

被引：46
|
作者：
Aldowaisan, T [1 ]
机构：
[1] Kuwait Univ, Coll Engn & Petr, Dept Mech & Ind Engn, Safat, Kuwait
来源：
COMPUTERS & OPERATIONS RESEARCH | 2001年 / 28卷 / 06期
关键词：
two-machine flowshop; sequence-independent setup time; no-wait; total flowtime;
D O I：
10.1016/S0305-0548(99)00136-7
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The two-machine no-wait flowshop problem, where setup times are considered separate from processing times and sequence independent, is addressed with respect to minimizing total flowtime. A local and a global dominance relation are developed and a new heuristic is provided. Furthermore, a lower bound is obtained and used along with the dominance relations in a branch-and-bound algorithm in order to evaluate the efficiency of the heuristic. Computational experience demonstrates the superiority of the local dominance relation and the new heuristic.
引用
收藏
页码：563 / 584
页数：22
相关论文
共 50 条
  • [1] A new heuristic for minimal makespan in no-wait hybrid flowshops
    Chang, Junlin
    Ma, Guangfu
    Ma, Xiaoping
    [J]. 2006 CHINESE CONTROL CONFERENCE, VOLS 1-5, 2006, : 395 - +
  • [2] 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
  • [3] 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
  • [4] New heuristics for no-wait flowshops to minimize makespan
    Aldowaisan, T
    Allahverdi, A
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (08) : 1219 - 1231
  • [5] MINIMIZING TOTAL TARDINESS IN NO-WAIT FLOWSHOPS
    Aldowaisan, Tariq
    Allahverdi, Ali
    [J]. FOUNDATIONS OF COMPUTING AND DECISION SCIENCES, 2012, 37 (03) : 149 - 162
  • [6] Hybrid Heuristic for m-Machine No-Wait Flowshops to Minimize Total Completion Time
    Zhu, Xia
    Li, XiaoPing
    Wang, Qian
    [J]. COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN IV, 2008, 5236 : 192 - 203
  • [7] A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
    Sidney, JB
    Potts, CN
    Sriskandarajah, C
    [J]. OPERATIONS RESEARCH LETTERS, 2000, 26 (04) : 165 - 173
  • [8] 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
  • [9] A Metaheuristic for No-wait Flowshops with Variable Processing Times
    Xu, Yi
    Li, Xiaoping
    Shi, Chaomin
    Cui, Mingyu
    Cao, Xincheng
    Ge, Yanyan
    [J]. PROCEEDINGS OF THE 2018 IEEE 22ND INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN ((CSCWD)), 2018, : 479 - 484
  • [10] Scheduling and lot streaming in flowshops with no-wait in process
    Hall, NG
    Laporte, G
    Selvarajah, E
    Sriskandarajah, C
    [J]. JOURNAL OF SCHEDULING, 2003, 6 (04) : 339 - 354
12345