Login / Signup
A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times.
Krzysztof Fleszar
Christoforos Charalambous
Khalil S. Hindi
Published in:
J. Intell. Manuf. (2012)
Keyphrases
</>
unrelated parallel machines
setup times
scheduling problem
parallel machines
processing times
single machine
lot sizing
multi item
flowshop
scheduling jobs
single machine scheduling problem
open shop
strongly np hard
precedence constraints
lagrangian relaxation
release dates
single server
multistage
upper bound