Abstract
We study a single machine scheduling problem, where the goal is to maximize the weighted number of jobs completed exactly at their due-dates. The option of job-rejection is considered, i.e., the scheduler may perform only a subset of the jobs. An upper bound on the total permitted rejection cost is assumed. The problem is proved to be NP-hard, and a pseudo-polynomial dynamic programming algorithm is introduced. Our numerical tests indicate that the proposed algorithm performs well: medium size instances (of up to 100 jobs) are solved in less than 1 s.
Original language | English |
---|---|
Pages (from-to) | 2707-2719 |
Number of pages | 13 |
Journal | Operational Research |
Volume | 22 |
Issue number | 3 |
DOIs | |
State | Published - Jul 2022 |
Bibliographical note
Publisher Copyright:© 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH, DE part of Springer Nature.
Keywords
- Dynamic programming
- Job-rejection
- Max-on-time
- Scheduling
- Single machine