Abstract
We study a single machine scheduling problem with generalized due-dates and general position-dependent job processing times. The objective function is minimum number of tardy jobs. The problem is proved to be NP-hard in the strong sense. We introduce an efficient algorithm that solves medium size problems in reasonable running time. A simple and efficient heuristic is also introduced, which obtained the optimal solution in the vast majority of our tests.
| Original language | English |
|---|---|
| Pages (from-to) | 833-845 |
| Number of pages | 13 |
| Journal | Optimization Letters |
| Volume | 19 |
| Issue number | 4 |
| DOIs | |
| State | Published - May 2025 |
Bibliographical note
Publisher Copyright:© The Author(s) 2024.
Keywords
- Generalized due-dates
- Minimum number of tardy jobs
- Position-dependent processing times
- Scheduling
- Single machine
Fingerprint
Dive into the research topics of 'Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver