Similarly, if we consider what happens after the completion of each operation, the longest path from each operation to the sink node is time which has to pass in any case after the completion of the operation. This corresponds to remaining work for the operations (let's call it tail). | ![]() |