Login / Signup
Time complexity of single- and identical parallel-machine scheduling with GERT network precedence constraints.
Jürgen Zimmermann
Published in:
Math. Methods Oper. Res. (1999)
Keyphrases
</>
precedence constraints
scheduling problem
setup times
branch and bound algorithm
vertex cover
single machine scheduling problem
precedence relations
special case
partially ordered
parallel processors
release dates
lower bound
worst case
approximation algorithms
unit length