Problem bank

Problem 249 of 333MediumCodingP249

Earliest finish time for a job pipeline

  1. An overnight risk pipeline has jobs with durations in hours: prices 3, fx 1, returns 2, risk 4, report 1. Dependencies: returns needs prices and fx; risk needs returns; report needs risk and fx. Any number of jobs can run in parallel once their prerequisites are done. What is the earliest time the whole pipeline can finish? Give an algorithm for the general case and its complexity.