An approximation algorithm for multi-agent scheduling on two uniform parallel machines.
Manzhan GuXiwen LuJinwei GuPublished in: Optim. Lett. (2019)
Keyphrases
- multi agent
- optimization algorithm
- experimental evaluation
- cost function
- search space
- learning algorithm
- recognition algorithm
- monte carlo
- approximation ratio
- significant improvement
- computational complexity
- times faster
- matching algorithm
- closed form
- clustering method
- detection algorithm
- genetic algorithm
- computational cost
- preprocessing
- optimal solution
- response time
- particle swarm optimization
- computationally efficient
- high accuracy
- scheduling problem
- tree structure
- k means
- lower bound
- image sequences
- improved algorithm
- data sets