A new neighborhood structure for round robin scheduling problems.

Tiago Januario Sebastián Urrutia

Published in: Comput. Oper. Res. (2016)

Keyphrases

round robin
neighborhood structure
scheduling problem
graph model
load balancing
job shop scheduling problem
nonlinear dimensionality reduction
np hard
tabu search
minimum spanning tree
nearest neighbor search
hamming distance
graph laplacian
data sets
locality preserving projections
random walk