Abstract
The scheduling measure of minimum weighted number of early jobs has hardly been investigated by scheduling researchers. This note focuses on a single machine scheduling and due-date assignment problem with the objective function of minimizing the weighted number of early jobs plus total weighted tardiness (given a common due-date for all jobs). The problem is proved to be NP-hard, and based on a number of properties of an optimal schedule, a pseudo-polynomial dynamic programming algorithm is introduced. Based on our numerical tests, the proposed algorithm is efficient and practical: medium size problems (of up to 150 jobs) are solved in very reasonable running times.
| Original language | English |
|---|---|
| Pages (from-to) | 383-391 |
| Number of pages | 9 |
| Journal | 4OR |
| Volume | 23 |
| Issue number | 4 |
| DOIs | |
| State | Published - Dec 2025 |
Bibliographical note
Publisher Copyright:© The Author(s), under exclusive licence to Associazione Italiana di Ricerca Operativa, The Belgian Operational Research Society, and Société Française de Recherche Opérationnelle et d'Aide à la Décision 2025.
Keywords
- Due-date assignment
- Dynamic programming
- Earliness-Tardiness
- Scheduling
- Single machine
Fingerprint
Dive into the research topics of 'Single machine scheduling to minimize weighted number of early jobs plus total weighted tardiness'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver