Abstract
We consider the problem of scheduling deteriorating jobs or shortening jobs with two agents A and B. We are interested in generating all Pareto-optimal schedules for the two criteria: (1) the total completion time of the jobs in A and the maximum cost of the jobs in B, and (2) the maximum cost of the jobs in A and the maximum cost of the jobs in B. We show that all Pareto-optimal schedules for both problems can be generated in polynomial time, whether the jobs are deteriorating or shortening.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 362-377 |
| Number of pages | 16 |
| Journal | Journal of Combinatorial Optimization |
| Volume | 34 |
| Issue number | 2 |
| DOIs | |
| State | Published - Aug 1 2017 |
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Discrete Mathematics and Combinatorics
- Control and Optimization
- Computational Theory and Mathematics
- Applied Mathematics
Keywords
- Deteriorating jobs
- Maximum cost
- Scheduling
- Shortening jobs
- Total completion time
- Two agents