Job Shop Problem: How do you get an ordered sequence of operations from the disjunctive acyclic graph?
The graph consisting of all vertices corresponding to a particular machine and the induced chosen edges form a directed path. This path tells you exactly which jobs to run on that machine and in what order.
The length of the longest weighted path from u to a job tells you exactly when you can start processing that job.