Complexity and approximation for scheduling problem for a torpedo

This paper considers a special case of the coupled-tasks scheduling problem on one processor. The general problems were analyzed in depth by Orman and Potts [1]. In this paper, we consider that all processing times are equal to 1, the gap has exact length L, we have precedence constraints, compatibility constraints are introduced and the criterion is to minimize the scheduling length. We use this problem to study the problem of data acquisition and data treatment of a torpedo under the water. We show that this problem is NP-complete and we propose an p-approximation algorithm where p <= (L+6)/6.