Name
Abstract | ||
|---|---|---|
We study a single-machine scheduling problem with two competing agents. The objective function of one agent is minimizing total late work, whereas the maximum cost of the jobs of the second agent cannot exceed a given upper bound. We introduce and test a pseudo-polynomial dynamic programming algorithm for this NP-hard problem. Our tests indicate that the algorithm can handle large-size instances (containing hundreds of jobs) fairly quickly. We then extend the setting to that of job rejection, where the scheduler may decide to process only a subset of the jobs. The dynamic programming algorithm is modified accordingly, and our numerical tests verify that medium-size instances (containing less than 100 jobs) are solved in reasonable time. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.cor.2021.105329 | COMPUTERS & OPERATIONS RESEARCH |
Keywords | DocType | Volume |
Scheduling, Single-machine, Two AGENTS, Total late work, Job-rejection, Dynamic programming | Journal | 133 |
ISSN | Citations | PageRank |
0305-0548 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Freud | 1 | 0 | 0.34 |
| Gur Mosheiov | 2 | 1 | 1.36 |