Login / Signup
A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times.
Gabriella Stecco
Jean-François Cordeau
Elena Moretti
Published in:
Comput. Oper. Res. (2008)
Keyphrases
</>
scheduling problem
setup times
np hard
dynamic programming
computational complexity
worst case
objective function
single machine scheduling problem
strongly np hard
particle swarm optimization
search space
steady state
flowshop
job shop scheduling problem
metaheuristic
simulated annealing
manufacturing cell