Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated

被引：27
|
作者：
Brown, SI
McGarvey, R
Ventura, JA [1 ]
机构：
[1] Penn State Univ, Harold & Inge Marcus Dept Ind & Mfg Engn, University Pk, PA 16802 USA
[2] RAND Corp, Pittsburgh, PA USA
来源：
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2004年 / 55卷 / 06期
关键词：
scheduling flowshop; no-wait; heuristics; integer programming; travelling salesman;
D O I：
10.1057/palgrave.jors.2601695
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper addresses the m-machine no-wait flowshop problem where the set-up time of a job is separated from its processing time. The performance measures considered are the total flowtime and makespan. The scheduling problem for makespan reduces to the travelling salesman problem (TSP), and the scheduling problem for total flowtime reduces to the time-dependent travelling salesman problem (TDTSP). Non-polynomial time solution methods are presented, along with a polynomial heuristic.
引用
收藏
页码：614 / 621
页数：8
相关论文
共 50 条
  • [1] Total flowtime in no-wait flowshops with separated setup times
    Aldowaisan, Tariq
    Allahverdi, Ali
    Computers and Operations Research, 1998, 25 (09): : 757 - 765
  • [2] Total flowtime in no-wait flowshops with separated setup times
    Aldowaisan, T
    Allahverdi, A
    COMPUTERS & OPERATIONS RESEARCH, 1998, 25 (09) : 757 - 765
  • [3] New heuristics for m-machine no-wait flowshop to minimize total completion time
    Aldowaisan, T
    Allahverdi, A
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2004, 32 (05): : 345 - 352
  • [4] The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
    Allahverdi, A
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 147 (02) : 373 - 396
  • [5] Branch-and-bound algorithms for scheduling in an m-machine no-wait flowshop
    Narayanaprasad Madhushini
    Chandrasekharan Rajendran
    Sādhanā, 2020, 45
  • [6] Minimizing makespan for no-wait flowshop scheduling problems with setup times
    Ying, Kuo-Ching
    Lin, Shih-Wei
    COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 121 : 73 - 81
  • [7] A constructive heuristic for total flowtime minimization in a no-wait flowshop with sequence-dependent setup times
    Nagano, Marcelo Seido
    Miyata, Hugo Hissashi
    Araujo, Daniella Castro
    JOURNAL OF MANUFACTURING SYSTEMS, 2015, 36 : 224 - 230
  • [8] Iterative search method for total flowtime minimization no-wait flowshop problem
    Zhu, Xia
    Li, Xiaoping
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2015, 6 (05) : 747 - 761
  • [9] Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop
    Lin, Shih-Wei
    Lu, Chung-Cheng
    Ying, Kuo-Ching
    IEEE ACCESS, 2018, 6 : 78666 - 78677
  • [10] FLOWSHOP SCHEDULING WITH SET-UP, PROCESSING AND REMOVAL TIMES SEPARATED
    PROUST, C
    GUPTA, JND
    DESCHAMPS, V
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1991, 29 (03) : 479 - 493
12345