Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/662
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorYuan, JJ-
dc.creatorYang, AF-
dc.creatorCheng, TCE-
dc.date.accessioned2014-12-11T08:27:31Z-
dc.date.available2014-12-11T08:27:31Z-
dc.identifier.issn0377-2217-
dc.identifier.urihttp://hdl.handle.net/10397/662-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.rightsEuropean Journal of Operational Research © 2003 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectSchedulingen_US
dc.subjectPrecedence constraintsen_US
dc.subjectBatchesen_US
dc.titleA note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing timesen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage525-
dc.identifier.epage528-
dc.identifier.volume158-
dc.identifier.issue2-
dc.identifier.doi10.1016/S0377-2217(03)00361-8-
dcterms.abstractWe consider the single machine, serial batching scheduling problem 1|prec;p[sub j]=p;s-batch;r[sub j]|L[sub max]. The complexity of this problem is reported as open in the literature. By reducing this problem to the version without precedence constraints, we show that the problem is polynomially solvable.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationEuropean journal of operational research, 16 Oct. 2004, v. 158, no. 2, p. 525-528-
dcterms.isPartOfEuropean journal of operational research-
dcterms.issued2004-10-16-
dc.identifier.isiWOS:000222135200021-
dc.identifier.scopus2-s2.0-2642544022-
dc.identifier.eissn1872-6860-
dc.identifier.rosgroupidr21194-
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 
s-batch--release--lateness-v3.pdfPre-published version119.21 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

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

Downloads

185
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

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

WEB OF SCIENCETM
Citations

11
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.