Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness.
Imad AssayakhImed KacemGiorgio LucarelliPublished in: IWOCA (2023)
Keyphrases
- min max
- maximum lateness
- single machine
- scheduling problem
- release dates
- batch processing machines
- precedence constraints
- parallel machines
- flowshop
- completion times
- sequence dependent setup times
- deteriorating jobs
- single machine scheduling problem
- lower bound
- processing times
- branch and bound algorithm
- partial order
- computing systems
- setup times
- response time
- worst case
- dynamic programming
- np hard