A NO-WAIT FLOWSHOP SCHEDULING HEURISTIC TO MINIMIZE MAKESPAN

被引:33
|
作者
RAJENDRAN, C
机构
关键词
FLOWSHOP; HEURISTICS; SCHEDULING;
D O I
10.1057/jors.1994.65
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The scheduling problem in the no-wait or constrained flowshop, with the makespan objective, is considered in this article. A simple heuristic algorithm is proposed on the basis of heuristic preference relations and job insertion. When evaluated over a large number of problems of various sizes, the solutions given by the proposed heuristic are found to be fairly accurate and much superior to those given by the two existing heuristics.
引用
收藏
页码:472 / 478
页数:7
相关论文
共 50 条
  • [1] Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
    Lin, BMT
    Cheng, TCE
    COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (07) : 613 - 624
  • [2] An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan
    Engin, Orhan
    Gunaydin, Cengiz
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2011, 4 (04) : 521 - 529
  • [3] An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan
    Engin O.
    Günaydin C.
    International Journal of Computational Intelligence Systems, 2011, 4 (4) : 521 - 529
  • [4] Iterative local search algorithm for no-wait flowshop scheduling problems to minimize makespan
    Wang, Chuyang
    Li, Xiaoping
    Wang, Qian
    PROCEEDINGS OF THE 2008 12TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, VOLS I AND II, 2008, : 908 - +
  • [5] HEURISTIC ALGORITHMS FOR SCHEDULING IN THE NO-WAIT FLOWSHOP
    GANGADHARAN, R
    RAJENDRAN, C
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1993, 32 (03) : 285 - 290
  • [6] An improved heuristic for no-wait flow shop to minimize makespan
    Ye, Honghan
    Li, Wei
    Abedini, Amin
    JOURNAL OF MANUFACTURING SYSTEMS, 2017, 44 : 273 - 279
  • [7] No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
    Allahverdi, Ali
    Aydilek, Harun
    Aydilek, Asiye
    APPLIED MATHEMATICS AND COMPUTATION, 2020, 365
  • [8] Minimizing makespan for solving the distributed no-wait flowshop scheduling problem
    Lin, Shih-Wei
    Ying, Kuo-Ching
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 : 202 - 209
  • [9] Minimizing makespan for no-wait flowshop scheduling problems with setup times
    Ying, Kuo-Ching
    Lin, Shih-Wei
    COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 121 : 73 - 81
  • [10] An effective heuristic for no-wait flow shop production to minimize makespan
    Ye, Honghan
    Li, Wei
    Miao, Enming
    JOURNAL OF MANUFACTURING SYSTEMS, 2016, 40 : 2 - 7