Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria
Keyword(s):
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.
2007 ◽
Vol 18
(02)
◽
pp. 341-359
◽
2017 ◽
Vol 34
(02)
◽
pp. 1750010
◽
1979 ◽
Vol 30
(5)
◽
pp. 449
◽
SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS
2012 ◽
Vol 29
(04)
◽
pp. 1250019
◽
1983 ◽
Vol 2
(2)
◽
pp. 62-65
◽