Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/94212
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studiesen_US
dc.creatorHe, Ren_US
dc.creatorYuan, Jen_US
dc.creatorNg, CTen_US
dc.creatorCheng, TCEen_US
dc.date.accessioned2022-08-11T01:08:37Z-
dc.date.available2022-08-11T01:08:37Z-
dc.identifier.urihttp://hdl.handle.net/10397/94212-
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.rights© The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021en_US
dc.rightsThis version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use(https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms), but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.org/10.1007/s10878-021-00697-2.en_US
dc.subjectNumber of tardy jobsen_US
dc.subjectPareto-schedulingen_US
dc.subjectSchedulingen_US
dc.subjectTotal late worken_US
dc.subjectTwo agentsen_US
dc.titleTwo-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late worken_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage504en_US
dc.identifier.epage525en_US
dc.identifier.volume41en_US
dc.identifier.issue2en_US
dc.identifier.doi10.1007/s10878-021-00697-2en_US
dcterms.abstractWe consider the single-machine preemptive Pareto-scheduling problem with two competing agents A and B, where agent A wants to minimize the number of its jobs (the A-jobs) that is tardy, while agent B wants to minimize the total late work of its jobs (the B-jobs). We provide an O(nnAlog nA+ nBlog nB) -time algorithm that generates all the Pareto-optimal points, where nA is the number of the A-jobs, nB is the number of the B-jobs, and n= nA+ nB.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationJournal of combinatorial optimization, Feb. 2021, v. 41, no. 2, p. 504-525en_US
dcterms.isPartOfJournal of combinatorial optimizationen_US
dcterms.issued2021-02-
dc.identifier.scopus2-s2.0-85099567065-
dc.identifier.eissn1382-6905en_US
dc.description.validate202208 bckwen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberLMS-0053-
dc.description.fundingSourceOthersen_US
dc.description.fundingTextNational Natural Science Foundation of Chinaen_US
dc.description.pubStatusPublisheden_US
dc.identifier.OPUS43591532-
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Ng_Two-Agent_Preemptive_Pareto-Scheduling.pdfPre-Published version1.01 MBAdobe 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

120
Last Week
1
Last month
Citations as of Apr 14, 2025

Downloads

68
Citations as of Apr 14, 2025

SCOPUSTM   
Citations

12
Citations as of Sep 12, 2025

WEB OF SCIENCETM
Citations

12
Citations as of Oct 10, 2024

Google ScholarTM

Check

Altmetric


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