Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria
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 <i>A</i> is the total completion time, the maximum lateness, or the total late work while the objective function of agent...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-09-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/8/9/1517 |