Makespan minimization for scheduling unrelated parallel machines with setup times.

Kuo-Ching Ying Zne-Jung Lee Shih-Wei Lin

Published in: J. Intell. Manuf. (2012)

Keyphrases

unrelated parallel machines
makespan minimization
setup times
scheduling problem
parallel machines
processing times
flowshop

single machine
multi item
lot sizing
sequence dependent setup times
precedence constraints
release dates
single server

single machine scheduling problem
np hard
scheduling jobs
polynomially solvable
job shop scheduling problem
lagrangian relaxation

parallel computing
shared memory
objective function
resource allocation
tabu search
lower bound