Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/94212
| Title: | Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work | Authors: | He, R Yuan, J Ng, CT Cheng, TCE |
Issue Date: | Feb-2021 | Source: | Journal of combinatorial optimization, Feb. 2021, v. 41, no. 2, p. 504-525 | 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. | Keywords: | Number of tardy jobs Pareto-scheduling Scheduling Total late work Two agents |
Publisher: | Springer | Journal: | Journal of combinatorial optimization | EISSN: | 1382-6905 | DOI: | 10.1007/s10878-021-00697-2 | Rights: | © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 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. |
| 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 |
Access
View full-text via PolyU eLinks 
Page views
58
Last Week
1
1
Last month
Citations as of May 5, 2024
Downloads
46
Citations as of May 5, 2024
SCOPUSTM
Citations
10
Citations as of May 3, 2024
WEB OF SCIENCETM
Citations
9
Citations as of May 2, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.