Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks

We consider the problem to schedule n coupled-tasks in presence of treatment tasks. This work is motivated by the problem of data acquisition for a torpedo. In such context, we developp a O ( n log ( n ) ) polynomial-time algorithm for a specific coupled-tasks scheduling problem.