Approximation algorithms for scheduling real-time jobs with multiple feasible intervals.
Jian-Jia ChenJun WuChi-Sheng ShihPublished in: Real Time Syst. (2006)
Keyphrases
- approximation algorithms
- precedence constraints
- real time
- open shop
- np hard
- special case
- scheduling problem
- worst case
- strongly np hard
- minimum cost
- job shop
- release dates
- parallel machines
- network design problem
- vertex cover
- identical parallel machines
- set cover
- single machine scheduling problem
- primal dual
- setup times
- resource allocation
- disjoint paths
- facility location problem
- batch processing
- approximation schemes
- sequence dependent setup times
- scheduling strategy
- job shop scheduling
- randomized algorithms
- combinatorial auctions
- job scheduling
- approximation ratio
- wafer fabrication
- constant factor approximation
- polynomial time approximation
- computational grids
- parallel processors
- resource constraints
- flowshop
- computational complexity