Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/94214
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studiesen_US
dc.creatorGao, Yen_US
dc.creatorYuan, Jen_US
dc.creatorNg, CTen_US
dc.creatorCheng, TCEen_US
dc.date.accessioned2022-08-11T01:08:40Z-
dc.date.available2022-08-11T01:08:40Z-
dc.identifier.issn1862-4472en_US
dc.identifier.urihttp://hdl.handle.net/10397/94214-
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.rights© Springer-Verlag GmbH Germany, part of Springer Nature 2020en_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/s11590-020-01576-1.en_US
dc.subjectCompeting agentsen_US
dc.subjectDeadlineen_US
dc.subjectPareto-schedulingen_US
dc.subjectPositional due indicesen_US
dc.subjectPrecedence constrainten_US
dc.titleA note on competing-agent Pareto-schedulingen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage249en_US
dc.identifier.epage262en_US
dc.identifier.volume15en_US
dc.identifier.issue1en_US
dc.identifier.doi10.1007/s11590-020-01576-1en_US
dcterms.abstractWe consider Pareto-scheduling with two competing agents A and B on a single machine, in which each job has a positional due index and a deadline. The jobs of agents A and B are called the A-jobs and B-jobs, respectively, where the A-jobs have a common processing time, while the B-jobs are restricted by their precedence constraint. The objective is to minimize a general sum-form objective function of the A-jobs and a general max-form objective function of the B-jobs, where all the objective functions are regular. We show that the problem is polynomially solvable.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationOptimization letters, Feb. 2021, v. 15, no. 1, p. 249-262en_US
dcterms.isPartOfOptimization lettersen_US
dcterms.issued2021-02-
dc.identifier.scopus2-s2.0-85082940716-
dc.identifier.eissn1862-4480en_US
dc.description.validate202208 bckwen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberLMS-0050-
dc.description.fundingSourceOthersen_US
dc.description.fundingTextChina Postdoctoral Science Foundation; National Natural Science Foundation of Chinaen_US
dc.description.pubStatusPublisheden_US
dc.identifier.OPUS21125834-
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Ng_Note_Competing-Agent_Pareto-Scheduling.pdfPre-Published version800.67 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

48
Last Week
1
Last month
Citations as of May 12, 2024

Downloads

54
Citations as of May 12, 2024

SCOPUSTM   
Citations

8
Citations as of May 16, 2024

WEB OF SCIENCETM
Citations

9
Citations as of May 16, 2024

Google ScholarTM

Check

Altmetric


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