The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions.

Published in: Oper. Res. (1979)

Keyphrases

maximum flow
series parallel
dynamic programming
minimum cut
computational complexity
optimization algorithm
np hard
scheduling problem
parallel machines
precedence constraints
optimal solution
probabilistic model
worst case
simulated annealing
graphical models
push relabel