Dynamic inhibition areas for accurately solving the shortest link scheduling problem.

Eugenio Celada-Funes Baltasar Beferull-Lozano

Published in: ICC (2013)

Keyphrases

scheduling problem
np hard
dynamic environments
shortest path
single machine
search engine
tabu search
flowshop
data sets
special case