Approximation Algorithms for Scheduling Unrelated Parallel Machines.
Jan Karel LenstraDavid B. ShmoysÉva TardosPublished in: Math. Program. (1990)
Keyphrases
- unrelated parallel machines
- approximation algorithms
- open shop
- scheduling problem
- np hard
- parallel machines
- special case
- primal dual
- worst case
- approximation ratio
- minimum cost
- job shop
- flowshop
- constant factor
- precedence constraints
- setup times
- optimal solution
- integer programming
- processing times
- job shop scheduling
- dynamic programming