Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/98392
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studiesen_US
dc.creatorLi, CLen_US
dc.creatorLee, Ken_US
dc.date.accessioned2023-04-27T01:05:16Z-
dc.date.available2023-04-27T01:05:16Z-
dc.identifier.issn0160-5682en_US
dc.identifier.urihttp://hdl.handle.net/10397/98392-
dc.language.isoenen_US
dc.publisherPalgrave Macmillanen_US
dc.rights© 2016 Operational Research Society Ltd. All rights reserved.en_US
dc.rightsThis is an Accepted Manuscript of an article published by Taylor & Francis in Journal of the Operational Research Society on 21 Dec 2017 (published online), available at: http://www.tandfonline.com/10.1057/jors.2015.56.en_US
dc.subjectEqual processing time jobsen_US
dc.subjectInclusive processing setsen_US
dc.subjectParallel machinesen_US
dc.subjectSchedulingen_US
dc.titleA note on scheduling jobs with equal processing times and inclusive processing set restrictionsen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage83en_US
dc.identifier.epage86en_US
dc.identifier.volume67en_US
dc.identifier.issue1en_US
dc.identifier.doi10.1057/jors.2015.56en_US
dcterms.abstractWe consider the problem of scheduling n jobs on m parallel machines with inclusive processing set restrictions. Each job has a given release date, and all jobs have equal processing times. The objective is to minimize the makespan of the schedule. Li and Li (2015) have developed an O(n 2 +mn log n) time algorithm for this problem. In this note, we present a modified algorithm with an improved time complexity of O(min{m, log n} ⋅ n log n).en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationJournal of the Operational Research Society, 2016, v. 67, no. 1, p. 83-86en_US
dcterms.isPartOfJournal of the Operational Research Societyen_US
dcterms.issued2016-
dc.identifier.scopus2-s2.0-84950238634-
dc.identifier.eissn1476-9360en_US
dc.description.validate202304 bckwen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberLMS-0526-
dc.description.fundingSourceOthersen_US
dc.description.fundingTextHong Kong Polytechnic University; PSC CUNY (The City University of New York) Granten_US
dc.description.pubStatusPublisheden_US
dc.identifier.OPUS6601267-
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Li_Note_Scheduling_Jobs.pdfPre-Published version650.32 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

81
Citations as of Apr 14, 2025

Downloads

43
Citations as of Apr 14, 2025

SCOPUSTM   
Citations

11
Citations as of Dec 19, 2025

WEB OF SCIENCETM
Citations

9
Citations as of Oct 10, 2024

Google ScholarTM

Check

Altmetric


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