A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots.

Konstantin Kogan Eugene Levner

Published in: Comput. Oper. Res. (1998)

Keyphrases

small scale
optimal solution
search space
dynamic programming
simulated annealing
computational complexity
np hard
path planning
multiple robots
objective function
special case
particle swarm optimization
single machine
knapsack problem
multi robot
parallel machines