An Approximate Algorithm for the Partitionable Independent Task Scheduling Problem.
Krishna P. BelkhalePrithviraj BanerjeePublished in: ICPP (1) (1990)
Keyphrases
- np hard
- scheduling problem
- cost function
- computational complexity
- experimental evaluation
- dynamic programming
- objective function
- improved algorithm
- times faster
- similarity measure
- mobile robot
- probabilistic model
- matching algorithm
- high accuracy
- classification algorithm
- theoretical analysis
- optimization algorithm
- detection algorithm
- particle swarm optimization
- convergence rate
- optimal solution
- clustering method
- special case
- input data
- search space
- computational cost
- k means
- significant improvement