Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1267
DC FieldValueLanguage
dc.contributor.authorNong, QQen_US
dc.contributor.authorCheng, TCEen_US
dc.contributor.authorNg, CTDen_US
dc.date.accessioned2014-12-11T08:23:52Z-
dc.date.available2014-12-11T08:23:52Z-
dc.date.issued2008-09-
dc.identifier.citationOperations research letters, Sept. 2008, v. 36, no. 5, p. 584-588en_US
dc.identifier.issn0167-6377-
dc.identifier.urihttp://hdl.handle.net/10397/1267-
dc.description.abstractWe consider the problem of on-line scheduling a set of n jobs on two parallel batch processing machines. The objective is to minimize the makespan. (See Article file for details of the abstract.)en_US
dc.description.sponsorshipDepartment of Logistics and Maritime Studiesen_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofOperations research lettersen_US
dc.rightsOperations Research Letters © 2008 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectOn-line schedulingen_US
dc.subjectParallel machinesen_US
dc.subjectBatchen_US
dc.subjectWorst-case analysisen_US
dc.subjectCompetitive ratioen_US
dc.titleAn improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machinesen_US
dc.typeJournal/Magazine Articleen_US
dc.description.otherinformationAuthor name used in this publication: T. C. E. Chengen_US
dc.description.otherinformationAuthor name used in this publication: C. T. Ngen_US
dc.identifier.spage584-
dc.identifier.epage588-
dc.identifier.volume36-
dc.identifier.issue5-
dc.identifier.doi10.1016/j.orl.2008.03.004-
dc.identifier.isiWOS:000259874700017-
dc.identifier.scopus2-s2.0-50249137689-
dc.identifier.eissn1872-7468-
dc.identifier.rosgroupidr41035-
dc.description.ros2008-2009 > Academic research: refereed > Publication in refereed journal-
dc.description.oapreprint_postprint-
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
P2-batch-online.pdfPre-published version180.89 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show simple item record
PIRA download icon_1.1View/Download Contents

SCOPUSTM   
Citations

20
Last Week
0
Last month
0
Citations as of Nov 30, 2019

WEB OF SCIENCETM
Citations

17
Last Week
0
Last month
0
Citations as of Dec 2, 2019

Page view(s)

421
Last Week
0
Last month
Citations as of Dec 4, 2019

Download(s)

610
Citations as of Dec 4, 2019

Google ScholarTM

Check

Altmetric


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