Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/654
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorCheng, TCE-
dc.creatorYuan, JJ-
dc.creatorYang, AF-
dc.date.accessioned2014-12-11T08:27:33Z-
dc.date.available2014-12-11T08:27:33Z-
dc.identifier.issn0305-0548-
dc.identifier.urihttp://hdl.handle.net/10397/654-
dc.language.isoenen_US
dc.publisherPergamon Pressen_US
dc.rightsComputers & Operations Research © 2003 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectSchedulingen_US
dc.subjectBatch processingen_US
dc.subjectPrecedence constraintsen_US
dc.subjectRelease datesen_US
dc.subjectIdentical processing timesen_US
dc.subjectAlgorithmsen_US
dc.titleScheduling a batch-processing machine subject to precedence constraints, release dates and identical processing timesen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage849-
dc.identifier.epage859-
dc.identifier.volume32-
dc.identifier.issue4-
dc.identifier.doi10.1016/j.cor.2003.09.001-
dcterms.abstractWe consider the single machine parallel-batching scheduling problem with precedence relations, release dates and identical processing times to minimize a regular objective function. When the processing times are unit, we give an O(n²) time optimal algorithm. When there are no precedence relations, we solve this problem by dynamic programming in O(n³) time. When the precedence relations are "layerly complete", we solve this problem by a dynamic programming algorithm that runs in O(n[sup 7]) time. For the total weighted completion time minimization problem, we give an O(n²) time [3/2]-approximation algorithm. For the makespan minimization problem, we give an O(n²) time optimal algorithm and an expression of the minimum makespan.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationComputers and operations research, Apr. 2005, v. 32, no. 4, p. 849-859-
dcterms.isPartOfComputers and operations research-
dcterms.issued2005-04-
dc.identifier.isiWOS:000224928400008-
dc.identifier.scopus2-s2.0-5644246437-
dc.identifier.eissn1873-765X-
dc.identifier.rosgroupidr24128-
dc.description.ros2004-2005 > 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 
p-batch-identical.pdfPre-published version125.1 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

108
Last Week
1
Last month
Citations as of Oct 1, 2023

Downloads

178
Citations as of Oct 1, 2023

SCOPUSTM   
Citations

25
Last Week
0
Last month
0
Citations as of Sep 28, 2023

WEB OF SCIENCETM
Citations

22
Last Week
0
Last month
0
Citations as of Sep 28, 2023

Google ScholarTM

Check

Altmetric


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