Iterated greedy local search methods for unrelated parallel machine scheduling.

Luis Fanjul-Peyro Rubén Ruiz

Published in: Eur. J. Oper. Res. (2010)

Keyphrases

iterated greedy
greedy algorithm
scheduling problem
setup times
memetic algorithm
search methods
processing times
hill climbing
search problems
sat problem
tie breaking
simulated annealing
heuristic search
worst case
single machine
objective function
orders of magnitude
flowshop