Average-Case Performance Analysis Of Online Non-Clairvoyant Scheduling Of Parallel Tasks With Precedence Constraints.
Keqin LiPublished in: Comput. J. (2008)
Keyphrases
- precedence constraints
- average case
- scheduling problem
- parallel machines
- parallel processors
- identical machines
- branch and bound algorithm
- worst case
- online algorithms
- approximation algorithms
- precedence relations
- release dates
- sequence dependent setup times
- uniform distribution
- maximum lateness
- worst case analysis
- single machine
- vertex cover
- single machine scheduling problem
- unit length
- np hard
- lower bound
- partially ordered
- shared memory
- setup times
- partial order
- upper bound
- global constraints
- flowshop
- release times
- tabu search
- learning algorithm
- average case complexity
- search problems
- parallel computing
- processing times
- search algorithm
- optimal solution