Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work

Ruyan He, Jinjiang Yuan (), C. T. Ng and T. C. E. Cheng
Additional contact information
Ruyan He: Zhengzhou University
Jinjiang Yuan: Zhengzhou University
C. T. Ng: The Hong Kong Polytechnic University
T. C. E. Cheng: The Hong Kong Polytechnic University

Journal of Combinatorial Optimization, 2021, vol. 41, issue 2, No 13, 504-525

Abstract: 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(nn_{A}\log n_{A}+n_B\log n_B)$$ O ( n n A log n A + n B log n B ) -time algorithm that generates all the Pareto-optimal points, where $$n_A$$ n A is the number of the A-jobs, $$n_B$$ n B is the number of the B-jobs, and $$n=n_A+n_B$$ n = n A + n B .

Keywords: Scheduling; Two agents; Pareto-scheduling; Number of tardy jobs; Total late work (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00697-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:41:y:2021:i:2:d:10.1007_s10878-021-00697-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-021-00697-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().