Approximation Algorithms for Scheduling Multiple Feasible Interval Jobs.
Jian-Jia ChenJun WuChi-Sheng ShihTei-Wei KuoPublished in: RTCSA (2005)
Keyphrases
- approximation algorithms
- precedence constraints
- open shop
- np hard
- scheduling problem
- special case
- strongly np hard
- worst case
- minimum cost
- parallel machines
- release dates
- vertex cover
- identical parallel machines
- scheduling strategy
- job shop
- sequence dependent setup times
- facility location problem
- network design problem
- processing times
- single machine scheduling problem
- job scheduling
- primal dual
- approximation schemes
- constant factor
- unrelated parallel machines
- set cover
- randomized algorithms
- computational grids
- optimal solution
- np hardness
- scheduling policies
- resource consumption
- flowshop
- partial order
- wafer fabrication