Parallel job DAG makespan

You have a dependency DAG of jobs and K identical workers. jobs is a list of [id, duration]; deps is a list of [a, b] meaning job a must finish before job b starts. A job becomes eligible the moment all its dependencies have completed. At each decision point, idle workers pick eligible jobs in ascending id order. Each worker runs one job to completion (non-preemptive). Return the overall makespan (the time the last job finishes). Assume the DAG is valid (no cycles) and ids are unique non-negative integers.