Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time.
Nick FischerLeo WennmannPublished in: ICALP (2024)
Keyphrases
- single machine
- weighted number of tardy jobs
- scheduling problem
- number of tardy jobs
- processing times
- total weighted tardiness
- completion times
- earliness tardiness
- maximum lateness
- total tardiness
- minimize total
- release times
- scheduling jobs
- production scheduling
- release dates
- learning effect
- weighted tardiness
- dynamic programming
- single machine scheduling problem
- sequence dependent setup times
- competitive ratio
- setup times
- rolling horizon
- worst case
- flowshop
- np hard