No-wait flexible flowshop scheduling with no-idle machines

被引：22
|
作者：
Wang, ZB [1 ]
Xing, WX [1 ]
Bai, FS [1 ]
机构：
[1] Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China
来源：
OPERATIONS RESEARCH LETTERS | 2005年 / 33卷 / 06期
基金：
中国国家自然科学基金;
关键词：
scheduling; flexible flowshop; no-wait; no-idle; heuristics;
D O I：
10.1016/j.orl.2004.10.004
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper considers a two-stage flexible flowshop scheduling problem with no waiting time between two sequential operations of a job and no idle time between two consecutive processed jobs on machines of the second stage. We show its complexity and present a heuristic algorithm with asymptotically tight error bounds. (c) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：609 / 614
页数：6
相关论文
共 50 条
  • [1] Two algorithms for no-wait flexible flowshop scheduling problem with no-idle machines
    Jin, Qingwei
    Xing, Wenxun
    [J]. Proceedings of the Sixth International Conference on Information and Management Sciences, 2007, 6 : 636 - 640
  • [2] No-wait or no-idle permutation flowshop scheduling with dominating machines
    Wang J.-B.
    Xia Z.-Q.
    [J]. Journal of Applied Mathematics and Computing, 2005, 17 (1-2) : 419 - 432
  • [3] FLOWSHOP NO-IDLE OR NO-WAIT SCHEDULING TO MINIMIZE THE SUM OF COMPLETION TIMES
    ADIRI, I
    POHORYLES, D
    [J]. NAVAL RESEARCH LOGISTICS, 1982, 29 (03) : 495 - 504
  • [4] On no-wait and no-idle flow shops with makespan criterion
    Kalczynski, Pawel Jan
    Kamburowski, Jerzy
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 178 (03) : 677 - 685
  • [5] Permutation, no-wait, no-idle flow shop problems
    Makuchowski, Mariusz
    [J]. ARCHIVES OF CONTROL SCIENCES, 2015, 25 (02): : 189 - 199
  • [6] STOCHASTIC FLOWSHOP NO-WAIT SCHEDULING
    FROSTIG, E
    ADIRI, I
    [J]. JOURNAL OF APPLIED PROBABILITY, 1985, 22 (01) : 240 - 246
  • [7] Flowshop/no-idle scheduling to minimise the mean flowtime
    Narain, L
    Bagga, PC
    [J]. ANZIAM JOURNAL, 2005, 47 : 265 - 275
  • [8] No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths
    Billaut, J. -C.
    Della Croce, F.
    Salassa, F.
    T'kindt, V.
    [J]. JOURNAL OF SCHEDULING, 2019, 22 (01) : 59 - 68
  • [9] No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths
    J.-C. Billaut
    F. Della Croce
    F. Salassa
    V. T’kindt
    [J]. Journal of Scheduling, 2019, 22 : 59 - 68
  • [10] HEURISTIC ALGORITHMS FOR SCHEDULING IN THE NO-WAIT FLOWSHOP
    GANGADHARAN, R
    RAJENDRAN, C
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1993, 32 (03) : 285 - 290
12345