On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

被引：17
|
作者：
Ng, CT
Cheng, TCE
Yuan, JJ
Liu, ZH
机构：
[1] Hong Kong Polytech Univ, Dept Management, Kowloon, Hong Kong, Peoples R China
[2] Zhengzhou Univ, Dept Math, Zhengzhou 450052, Peoples R China
[3] E China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China
来源：
OPERATIONS RESEARCH LETTERS | 2003年 / 31卷 / 04期
关键词：
scheduling; precedence constraints; batches;
D O I：
10.1016/S0167-6377(03)00007-5
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We consider the single machine, serial batching, total completion time scheduling problem with precedence constraints, release dates and identical processing times in this paper. The complexity of this problem is reported as, open in the literature. We provide an 0(n(5)) time algorithm to solve this problem. (C) 2003 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：323 / 326
页数：4
相关论文
共 50 条
  • [31] Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
    Suresh Chand
    Rodney Traub
    Reha Uzsoy
    Annals of Operations Research, 1997, 70 : 115 - 125
  • [32] Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
    Chand, S.
    Traub, R.
    Uzsoy, R.
    Annals of Operations Research, (70):
  • [33] Scheduling a single continuous batch processing machine to minimize total completion time
    Zhao, Yu-Fang
    Tang, Li-Xin
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2008, 36 (02): : 367 - 370
  • [34] Scheduling Single Machine Problem to Minimize Completion Time
    Suppiah, Yasothei
    Bhuvaneswari, Thangavel
    Yee, Pang Shen
    Yue, Ng Wei
    Horng, Chan Mun
    TEM JOURNAL-TECHNOLOGY EDUCATION MANAGEMENT INFORMATICS, 2022, 11 (02): : 552 - 556
  • [35] Flowshop scheduling problem to minimize total completion time with random and bounded processing times
    Sotskov, YN
    Allahverdi, A
    Lai, TC
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2004, 55 (03) : 277 - 286
  • [36] Two-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times
    Allahverdi, A
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 103 (01) : 386 - 400
  • [37] A Two-Machine Flowshop Scheduling Problem with a Job Precedence Constraint to Minimize the Total Completion Time
    Xu, Jianyou
    Lin, Win-Chin
    Yin, Yunqiang
    Cheng, Yu
    Wu, Chin-Chia
    JOURNAL OF SCIENTIFIC & INDUSTRIAL RESEARCH, 2017, 76 (12): : 761 - 766
  • [38] Bicriteria Scheduling on a Single Batching Machine with Transportation and Deterioration to Minimize Total Completion Time and Production Costs
    Gong, Hua
    Zhang, Ermei
    Liu, Fang
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2017, 34 (03)
  • [39] Single machine batch scheduling problem with family setup times and release dates to minimize makespan
    Yuan, J. J.
    Liu, Z. H.
    Ng, C. T.
    Cheng, T. C. E.
    JOURNAL OF SCHEDULING, 2006, 9 (06) : 499 - 513
  • [40] Single machine batch scheduling problem with family setup times and release dates to minimize makespan
    J. J. Yuan
    Z. H. Liu
    C. T. Ng
    T. C. E. Cheng
    Journal of Scheduling, 2006, 9 : 499 - 513
12345