An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications.
Evripidis BampisRodolphe GiroudeauJean-Claude KönigPublished in: STACS (2000)
Keyphrases
- np hard
- scheduling problem
- objective function
- detection algorithm
- approximation ratio
- high accuracy
- dynamic programming
- k means
- cost function
- computational cost
- tabu search
- closed form
- times faster
- similarity measure
- optimization algorithm
- decision trees
- theoretical analysis
- worst case
- significant improvement
- search space
- preprocessing
- neural network
- input data
- linear programming
- computational complexity
- combinatorial optimization
- error bounds
- approximation algorithms
- recognition algorithm
- error tolerance