Abstract
We study scheduling problems on parallel dedicated machines. Thus, each job can be processed on one specific machine only. The option of job-rejection is considered, and the total permitted rejection cost of all the jobs is bounded. Six scheduling problems are solved: ((Formula presented.)) minimising makespan, ((Formula presented.)) minimising makespan with release-dates, ((Formula presented.)) minimising total completion time, ((Formula presented.)) minimising total weighted completion time, ((Formula presented.)) minimising total load, and ((Formula presented.)) minimising maximum tardiness. Pseudo-polynomial dynamic programming algorithms are introduced for all these NP-hard problems.
| Original language | English |
|---|---|
| Pages (from-to) | 6933-6940 |
| Number of pages | 8 |
| Journal | International Journal of Production Research |
| Volume | 62 |
| Issue number | 19 |
| DOIs | |
| State | Published - 2024 |
Bibliographical note
Publisher Copyright:© 2024 Informa UK Limited, trading as Taylor & Francis Group.
Keywords
- Scheduling
- dynamic programming algorithm
- makespan
- parallel dedicated machines
- total completion time
- total load