Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine

被引：16
|
作者：
Liu, ZH
Cheng, TCE [1 ]
机构：
[1] Hong Kong Polytech Univ, Dept Logist, Kowloon, Hong Kong, Peoples R China
[2] E China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China
来源：
THEORETICAL COMPUTER SCIENCE | 2005年 / 347卷 / 1-2期
基金：
中国国家自然科学基金;
关键词：
scheduling; batch processing; approximation scheme;
D O I：
10.1016/j.tcs.2005.07.028
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A batch machine is a machine that can process a number of jobs simultaneously as a batch, and the processing time of a batch is equal to the longest processing time of the jobs assigned to it. In this paper, we present a polynomial time approximation scheme (PTAS) for scheduling a batch machine to minimize the total completion time with job release dates. Also, we present a fully polynomial time approximation scheme (FPTAS) for scheduling an unbounded batch machine, which can process an arbitrary number of jobs simultaneously, to minimize the total weighted completion time with job release dates. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码：288 / 298
页数：11
相关论文
共 50 条
  • [41] Genetic Local Search Algorithm for minimizing the total completion time in single machine scheduling problem with release dates and precedence constraints
    Zaidi, Ichraf
    Mrad, Mehdi
    Ladhari, Talel
    2013 5TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO), 2013,
  • [42] A branch-and-bound algorithm for minimizing the total completion time in two-machine flowshop problem subject to release dates
    Rakrouki, Mohamed Ali
    Ladhari, Talel
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 80 - +
  • [43] Minimizing the Total Completion Time in a Two-machine Flowshop with Release Times
    Gong, Hua
    Chen, Daheng
    PROCEEDINGS OF THE 2012 24TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2012, : 4136 - 4140
  • [44] Minimizing Total Earliness and Total Tardiness on Single Machine with Release Dates
    Oyetunji, E. O.
    Oluleye, A. E.
    INTERNATIONAL JOURNAL OF ENGINEERING RESEARCH IN AFRICA, 2011, 5 : 30 - 43
  • [45] Minimizing the total weighted completion time of deteriorating jobs
    Bachman, A
    Janiak, A
    Kovalyov, MY
    INFORMATION PROCESSING LETTERS, 2002, 81 (02) : 81 - 84
  • [46] Minimizing the total weighted completion time in relocation scheduling
    Su, Yi-Chen
    Lin, Bertrand M. T.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 173
  • [47] Minimizing the total weighted completion time in relocation scheduling
    Su, Yi-Chen
    Lin, Bertrand M.T.
    Computers and Industrial Engineering, 2022, 173
  • [48] Minimizing the total weighted completion time in the relocation problem
    Kononov, Alexander V.
    Lin, Bertrand M. T.
    JOURNAL OF SCHEDULING, 2010, 13 (02) : 123 - 129
  • [49] Minimizing the total weighted completion time in the relocation problem
    Alexander V. Kononov
    Bertrand M. T. Lin
    Journal of Scheduling, 2010, 13 : 123 - 129
  • [50] Minimizing total weighted completion time approximately for the parallel machine problem with a single server
    Hasani, Keramat
    Kravchenko, Svetlana A.
    Werner, Frank
    INFORMATION PROCESSING LETTERS, 2014, 114 (09) : 500 - 503
12345