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
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorLiu, Z-
dc.creatorCheng, TCE-
dc.date.accessioned2014-12-11T08:24:41Z-
dc.date.available2014-12-11T08:24:41Z-
dc.identifier.issn0304-3975-
dc.identifier.urihttp://hdl.handle.net/10397/631-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.rightsTheoretical Computer Science © 2005 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectSchedulingen_US
dc.subjectBatch processingen_US
dc.subjectApproximation schemeen_US
dc.titleApproximation schemes for minimizing total (weighted) completion time with release dates on a batch machineen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage288-
dc.identifier.epage298-
dc.identifier.volume347-
dc.identifier.issue1-2-
dc.identifier.doi10.1016/j.tcs.2005.07.028-
dcterms.abstractA 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.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationTheoretical computer science, 30 Nov. 2005, v. 347, no. 1-2, p. 288-298-
dcterms.isPartOfTheoretical computer science-
dcterms.issued2005-11-30-
dc.identifier.isiWOS:000234020600012-
dc.identifier.scopus2-s2.0-27844530191-
dc.identifier.rosgroupidr29973-
dc.description.ros2005-2006 > Academic research: refereed > Publication in refereed journal-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
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 simple 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.