Response Time Bounds for G-EDF without Intra-Task Precedence Constraints.
Jeremy P. EricksonJames H. AndersonPublished in: OPODIS (2011)
Keyphrases
- precedence constraints
- response time
- scheduling algorithm
- branch and bound algorithm
- scheduling problem
- lower bound
- upper bound
- single machine scheduling problem
- parallel machines
- approximation algorithms
- precedence relations
- release dates
- sequence dependent setup times
- partial order
- vertex cover
- parallel processors
- worst case
- maximum lateness
- branch and bound
- partially ordered
- series parallel
- partially ordered sets
- lower and upper bounds
- global constraints
- unit length
- quality of service
- query execution
- np hard
- error bounds
- search algorithm
- objective function
- genetic algorithm
- single machine
- combinatorial optimization
- tabu search