Scheduling a single machine with compressible jobs to minimize maximum lateness.
Nodari VakhaniaFrank WernerAlejandro ReynosoPublished in: CoRR (2022)
Keyphrases
- maximum lateness
- single machine
- minimize total
- job processing times
- completion times
- release dates
- scheduling problem
- batch processing machines
- processing times
- release times
- total weighted tardiness
- sequence dependent setup times
- weighted tardiness
- scheduling jobs
- deteriorating jobs
- dominance rules
- single machine scheduling problem
- weighted number of tardy jobs
- tardiness cost
- identical machines
- parallel machines
- flowshop
- identical parallel machines
- production scheduling
- number of late jobs
- dynamic programming
- setup times
- precedence constraints
- competitive ratio
- np hard
- job shop
- special case