Improved Approximation Schemes for Scheduling Unrelated Parallel Machines.
Klaus JansenLorant PorkolabPublished in: Math. Oper. Res. (2001)
Keyphrases
- unrelated parallel machines
- approximation schemes
- scheduling problem
- parallel machines
- approximation algorithms
- open shop
- setup times
- scheduling jobs
- np hard
- single machine
- processing times
- tabu search
- precedence constraints
- release dates
- higher order
- parallel computing
- job shop scheduling problem
- job shop scheduling
- upper bound