Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/631
PIRA download icon_1.1View/Download Full Text
Title: Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
Authors: Liu, Z
Cheng, TCE 
Issue Date: 30-Nov-2005
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.
Keywords: Scheduling
Batch processing
Approximation scheme
Publisher: Elsevier
Journal: Theoretical computer science 
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.07.028
Rights: Theoretical Computer Science © 2005 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
PTAS_B_Revised.pdfPre-published version166.81 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

141
Last Week
0
Last month
Citations as of Mar 24, 2024

Downloads

118
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

18
Last Week
0
Last month
0
Citations as of Mar 28, 2024

WEB OF SCIENCETM
Citations

15
Last Week
0
Last month
0
Citations as of Mar 28, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.