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-.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.