An improved approximation algorithm for a scheduling problem with transporter coordination.
Yinling WangXin HanYong ZhangJacek BlazewiczPublished in: J. Sched. (2023)
Keyphrases
- scheduling problem
- np hard
- computational complexity
- times faster
- closed form
- experimental evaluation
- objective function
- matching algorithm
- detection algorithm
- learning algorithm
- worst case
- particle swarm optimization
- theoretical analysis
- expectation maximization
- simulated annealing
- probabilistic model
- optimal solution
- preprocessing
- path planning
- polygonal approximation
- high accuracy
- search space
- significant improvement
- optimization algorithm
- cost function
- clustering method
- error bounds
- flowshop
- multi robot
- parallel machines
- dynamic programming
- polynomial time approximation