Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan.
Gais AlhadiImed KacemPierre LarocheIzzeldin M. OsmanPublished in: RAIRO Oper. Res. (2024)
Keyphrases
- scheduling jobs
- maximum lateness
- single machine
- identical parallel machines
- release dates
- scheduling problem
- completion times
- processing times
- parallel machines
- competitive ratio
- sequence dependent setup times
- flowshop
- single machine scheduling problem
- precedence constraints
- approximation algorithms
- dynamic programming
- setup times
- np hard
- strongly np hard
- combinatorial optimization