Please use this identifier to cite or link to this item:
Title: Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
Authors: Liu, Zhaohui
Cheng, T. C. Edwin
Subjects: Scheduling
Batch processing
Approximation scheme
Issue Date: 30-Nov-2005
Publisher: Elsevier B.V.
Source: Theoretical computer science, 30 Nov. 2005, v. 347, no. 1-2, p. 288-298.
Abstract: 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.
Rights: Theoretical Computer Science © 2005 Elsevier B.V. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/j.tcs.2005.07.028
ISSN: 0304-3975
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
PTAS_B_Revised.pdfPre-published version166.81 kBAdobe PDFView/Open

All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.