Review of properties of different precedence graphs for scheduling problems.

Jacek Blazewicz Daniel Kobler

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

Keyphrases

scheduling problem
precedence constraints
desirable properties
algebraic structures
data sets
partial order
graph theoretic
job shop scheduling
graph properties
neural network
search algorithm
graph matching
flowshop
structural properties
spanning tree
greedy heuristics