Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/94214
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | en_US |
dc.creator | Gao, Y | en_US |
dc.creator | Yuan, J | en_US |
dc.creator | Ng, CT | en_US |
dc.creator | Cheng, TCE | en_US |
dc.date.accessioned | 2022-08-11T01:08:40Z | - |
dc.date.available | 2022-08-11T01:08:40Z | - |
dc.identifier.issn | 1862-4472 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/94214 | - |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.rights | © Springer-Verlag GmbH Germany, part of Springer Nature 2020 | en_US |
dc.rights | This 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.subject | Competing agents | en_US |
dc.subject | Deadline | en_US |
dc.subject | Pareto-scheduling | en_US |
dc.subject | Positional due indices | en_US |
dc.subject | Precedence constraint | en_US |
dc.title | A note on competing-agent Pareto-scheduling | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 249 | en_US |
dc.identifier.epage | 262 | en_US |
dc.identifier.volume | 15 | en_US |
dc.identifier.issue | 1 | en_US |
dc.identifier.doi | 10.1007/s11590-020-01576-1 | en_US |
dcterms.abstract | We 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.accessRights | open access | en_US |
dcterms.bibliographicCitation | Optimization letters, Feb. 2021, v. 15, no. 1, p. 249-262 | en_US |
dcterms.isPartOf | Optimization letters | en_US |
dcterms.issued | 2021-02 | - |
dc.identifier.scopus | 2-s2.0-85082940716 | - |
dc.identifier.eissn | 1862-4480 | en_US |
dc.description.validate | 202208 bckw | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | LMS-0050 | - |
dc.description.fundingSource | Others | en_US |
dc.description.fundingText | China Postdoctoral Science Foundation; National Natural Science Foundation of China | en_US |
dc.description.pubStatus | Published | en_US |
dc.identifier.OPUS | 21125834 | - |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Ng_Note_Competing-Agent_Pareto-Scheduling.pdf | Pre-Published version | 800.67 kB | Adobe PDF | View/Open |
Page views
48
Last Week
1
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.