An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
Evripidis BampisRodolphe GiroudeauJean-Claude KönigPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- np hard
- high accuracy
- times faster
- detection algorithm
- objective function
- worst case
- segmentation algorithm
- input data
- dynamic programming
- preprocessing
- experimental evaluation
- computational cost
- k means
- cost function
- convergence rate
- approximation ratio
- scheduling problem
- neural network
- computational complexity
- hierarchical clustering
- optimization algorithm
- error tolerance
- recognition algorithm
- single machine
- optimal solution
- closed form
- matching algorithm
- significant improvement
- probabilistic model
- special case