Skip to Main content Skip to Navigation
Conference papers

Complexity and approximation for scheduling problem for a torpedo

Gilles Simonin 1 Rodolphe Giroudeau 1 Jean-Claude König 1
1 APR - Algorithmes et Performance des Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
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 and Potts. 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 rho-approximation algorithm where rho<=(L+6)/6.
Document type :
Conference papers
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00355052
Contributor : Gilles Simonin <>
Submitted on : Wednesday, January 21, 2009 - 5:43:38 PM
Last modification on : Monday, February 11, 2019 - 11:50:15 AM
Long-term archiving on: : Tuesday, June 8, 2010 - 7:08:38 PM

File

cie39_rapport.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-00355052, version 1

Collections

Citation

Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König. Complexity and approximation for scheduling problem for a torpedo. CIE'39: 39th International Conference on Computers & Industrial Engineering, Jul 2009, Troyes, France. pp.352-356. ⟨lirmm-00355052⟩

Share

Metrics

Record views

275

Files downloads

346