Improved Approximation Algorithms for Scheduling with Release Dates.
Michel X. GoemansPublished in: SODA (1997)
Keyphrases
- approximation algorithms
- release dates
- precedence constraints
- np hard
- single machine scheduling problem
- minimize total
- sequence dependent setup times
- single machine
- scheduling problem
- special case
- worst case
- processing times
- primal dual
- approximation ratio
- parallel machines
- setup times
- branch and bound algorithm
- polynomial time approximation
- combinatorial auctions
- strongly np hard