Complexity and approximation for scheduling problem for a torpedo

Author

Giroudeau, Rodolphe ; Konig, J.C. ; Simonin, Gilles

Author_Institution

LIRRMM, Motpellier, France

fYear

2009

fDate

6-9 July 2009

Firstpage

300

Lastpage

304

Abstract

This paper considers a special case of the coupled-tasks scheduling problem on one processor. The general problems were analyzed in depth by Orman ad Potts. In this paper, we consider that all processing times are equal to 1, the gap has exact length L, we have precedence constraits, compatibility constraits 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 rho-approximation algorithm where rho les (L+6)/6.

Keywords

approximation theory; computational complexity; data acquisition; naval engineering computing; scheduling; NP-complete problem; coupled-tasks scheduling; data acquisition; data treatment; rho-approximation algorithm; torpedo; Data acquisition; MONOS devices; NP-complete problem; Polynomials; Processor scheduling; Temperature measurement; Temperature sensors; Topology; Underwater vehicles; approximation; compatibility constraits; complexity; coupled-tasks; scheduling;

fLanguage

English

Publisher

ieee

Conference_Titel

Computers & Industrial Engineering, 2009. CIE 2009. International Conference on

Conference_Location

Troyes

Print_ISBN

978-1-4244-4135-8

Electronic_ISBN

978-1-4244-4136-5

Type

conf

DOI

10.1109/ICCIE.2009.5223825

Filename

5223825