Complexity and approximation for scheduling problem for a torpedo

Abstract

This paper considers a special case of the coupled-tasks schedulin~problem on one p~oces.sor. The general problems were analyzed in depth by Orman and Potts [1]. In this paper, we consider that a~l processing times ar~e~ual. to 1, t~~g~p has exact length L, we have precedence constraints, compatibility constraints are Introduced and the cntenon IS to mmmnze 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 thISproblem IS P -complete and we propose an p-approxlmatIon a gont were p _ -6-.