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 条
12345