An approximation algorithm for scheduling trees of malleable tasks.
Renaud LepèreGrégory MouniéDenis TrystramPublished in: Eur. J. Oper. Res. (2002)
Keyphrases
- preprocessing
- learning algorithm
- computational complexity
- cost function
- experimental evaluation
- optimal solution
- np hard
- monte carlo
- optimization algorithm
- linear programming
- times faster
- dynamic programming
- worst case
- recognition algorithm
- error bounds
- significant improvement
- polygonal approximation
- approximation ratio
- path planning
- resource allocation
- randomized algorithm
- segmentation algorithm
- theoretical analysis
- simulated annealing
- response time
- high accuracy
- scheduling problem
- probabilistic model
- computational cost