Chains of operations have to be scheduled on a single machine such that a minimum delay is set between any two operations linked by a precedence relation. Three sub-problems are shown to be solved in polynomial time. First, we consider the problem of minimizing the makespan when all the...