Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/94212
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | en_US |
dc.creator | He, R | 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:37Z | - |
dc.date.available | 2022-08-11T01:08:37Z | - |
dc.identifier.uri | http://hdl.handle.net/10397/94212 | - |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.rights | © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 | 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/s10878-021-00697-2. | en_US |
dc.subject | Number of tardy jobs | en_US |
dc.subject | Pareto-scheduling | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Total late work | en_US |
dc.subject | Two agents | en_US |
dc.title | Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 504 | en_US |
dc.identifier.epage | 525 | en_US |
dc.identifier.volume | 41 | en_US |
dc.identifier.issue | 2 | en_US |
dc.identifier.doi | 10.1007/s10878-021-00697-2 | en_US |
dcterms.abstract | We 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.accessRights | open access | en_US |
dcterms.bibliographicCitation | Journal of combinatorial optimization, Feb. 2021, v. 41, no. 2, p. 504-525 | en_US |
dcterms.isPartOf | Journal of combinatorial optimization | en_US |
dcterms.issued | 2021-02 | - |
dc.identifier.scopus | 2-s2.0-85099567065 | - |
dc.identifier.eissn | 1382-6905 | en_US |
dc.description.validate | 202208 bckw | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | LMS-0053 | - |
dc.description.fundingSource | Others | en_US |
dc.description.fundingText | National Natural Science Foundation of China | en_US |
dc.description.pubStatus | Published | en_US |
dc.identifier.OPUS | 43591532 | - |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Ng_Two-Agent_Preemptive_Pareto-Scheduling.pdf | Pre-Published version | 1.01 MB | Adobe PDF | View/Open |
Page views
65
Last Week
1
1
Last month
Citations as of May 19, 2024
Downloads
46
Citations as of May 19, 2024
SCOPUSTM
Citations
10
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.