A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines.
Kejun ZhaoXiwen LuManzhan GuPublished in: J. Sched. (2016)
Keyphrases
- multi agent
- preprocessing
- learning algorithm
- cost function
- recognition algorithm
- high accuracy
- optimization algorithm
- objective function
- search space
- computational cost
- experimental evaluation
- error bounds
- expectation maximization
- input data
- scheduling problem
- detection algorithm
- improved algorithm
- clustering method
- times faster
- scheduling algorithm
- convex hull
- convergence rate
- particle swarm optimization
- polynomial time approximation
- scheduling strategy
- tree structure
- ant colony optimization
- segmentation algorithm
- theoretical analysis
- worst case
- probabilistic model
- np hard
- computational complexity
- data structure
- reinforcement learning