Minimizing Makespan on Identical Parallel Machines.

Abey Kuruvilla Giuseppe Paletta

Published in: Int. J. Oper. Res. Inf. Syst. (2015)

Keyphrases

minimizing makespan
identical parallel machines
scheduling problem
flowshop
single machine
parallel machines
processing times
strongly np hard
precedence constraints
np hard
tabu search
release dates
setup times
single server
fixed number
genetic algorithm
learning algorithm