Minimizing the Makespan in a Robotic Cell Scheduling Problem.

Nacira Chikhi Moncef Abbas

Published in: CTW (2012)

Keyphrases

robotic cell
flowshop
scheduling problem
processing times
tabu search
minimizing makespan
sequence dependent setup times
setup times
special case
single machine
np hard
strongly np hard
precedence constraints
parallel machines
neural network
release dates
dynamic programming
force control