The Largest-Z-ratio-First algorithm is 0.8531-approximate for scheduling unreliable jobs on m parallel machines.
Alessandro AgnetisThomas LidbetterPublished in: Oper. Res. Lett. (2020)
Keyphrases
- parallel machines
- scheduling problem
- unrelated parallel machines
- minimize total
- list scheduling
- makespan minimization
- total tardiness
- sequence dependent setup times
- weighted tardiness
- dynamic programming
- identical parallel machines
- computational complexity
- optimal scheduling
- open shop
- scheduling strategy
- optimal solution
- np hard
- total weighted tardiness
- strongly np hard
- scheduling jobs
- worst case
- release dates
- setup times
- precedence constraints
- parallel implementation
- competitive ratio
- scheduling policies
- single server
- shared memory