Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem.

Yann Hendel Francis Sourd

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

Keyphrases

earliness tardiness
scheduling problem
parallel machines
flowshop
single machine
neighborhood search
processing times
single machine scheduling problem
np hard
precedence constraints
genetic algorithm
tabu search
release dates