Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria

Ruyan He and Jinjiang Yuan
Additional contact information
Ruyan He: School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, China
Jinjiang Yuan: School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, China

Mathematics, 2020, vol. 8, issue 9, 1-18

Abstract: In this paper, we consider three preemptive Pareto-scheduling problems with two competing agents on a single machine. In each problem, the objective function of agent A is the total completion time, the maximum lateness, or the total late work while the objective function of agent B is the total late work. For each problem, we provide a polynomial-time algorithm to characterize the trade-off curve of all Pareto-optimal points.

Keywords: two-agent; Pareto-scheduling; late work; trade-off curve; polynomial time (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://www.mdpi.com/2227-7390/8/9/1517/pdf (application/pdf)
https://www.mdpi.com/2227-7390/8/9/1517/ (text/html)

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:gam:jmathe:v:8:y:2020:i:9:p:1517-:d:409427

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().