Two-Agent Pareto-Scheduling of Minimizing Total Weighted Completion Time and Total Weighted Late Work
We investigate the Pareto-scheduling problem with two competing agents on a single machine to minimize the total weighted completion time of agent <i>A</i>’s jobs and the total weighted late work of agent <i>B</i>’s jobs, the <i>B</i>-jobs having a common due date...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-11-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/8/11/2070 |