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 条
  • [41] Single machine scheduling with precedence constraints and positionally dependent processing times
    Dolgui, Alexandre
    Gordon, Valery
    Strusevich, Vitaly
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (06) : 1218 - 1224
  • [42] Single machine due window assignment scheduling problem with precedence constraints and fuzzy processing times
    Li, Jinquan
    Xu, Dehua
    Li, Hongxing
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2018, 34 (06) : 4301 - 4314
  • [43] The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
    Nong, Q. Q.
    Ng, C. T.
    Cheng, T. C. E.
    OPERATIONS RESEARCH LETTERS, 2008, 36 (01) : 61 - 66
  • [44] Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
    Mellouli, Racem
    Sadfi, Cherif
    Chu, Chengbin
    Kacem, Imed
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (03) : 1150 - 1165
  • [45] AN ALGORITHM FOR SINGLE-MACHINE SEQUENCING WITH RELEASE DATES TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME
    HARIRI, AMA
    POTTS, CN
    DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) : 99 - 109
  • [46] Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints
    Kim, Eun-Seok
    Sung, Chang-Sup
    Lee, Ik-Sun
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (03) : 698 - 710
  • [47] The Lagrangean Relaxation for the Flow Shop Scheduling Problem with Precedence Constraints, Release Dates and Delivery Times
    Fabri, Marcelus
    Ramalhinho, Helena
    de Souza, Mauricio C.
    Ravetti, Martin G.
    JOURNAL OF ADVANCED TRANSPORTATION, 2019, 2019
  • [48] Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
    Eren, Tamer
    APPLIED MATHEMATICS AND COMPUTATION, 2009, 208 (02) : 355 - 358
  • [49] Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
    Pei, Jun
    Liu, Xinbao
    Pardalos, Panos M.
    Fan, Wenjuan
    Yang, Shanlin
    OPTIMIZATION LETTERS, 2015, 9 (01) : 91 - 104
  • [50] Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
    Jun Pei
    Xinbao Liu
    Panos M. Pardalos
    Wenjuan Fan
    Shanlin Yang
    Optimization Letters, 2015, 9 : 91 - 104
12345