Polynomial-Time Algorithms for Scheduling Problem for Coupled-Tasks in Presence of Treatment Tasks

Gilles Simonin 1 Rodolphe Giroudeau 1 Jean-Claude König 1
1 MAORE - Méthodes Algorithmes pour l'Ordonnancement et les Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : We consider the problem to schedule n coupled-tasks in presence of treatment tasks. This work is motivated by the problem of data acquisition for a torpedo. In such context, we developp a O(nlog(n)) polynomial-time algorithm for a large class of coupled-tasks scheduling problem.
Document type :
Conference papers
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00522986
Contributor : Gilles Simonin <>
Submitted on : Monday, October 4, 2010 - 10:30:34 AM
Last modification on : Monday, February 11, 2019 - 11:50:15 AM
Long-term archiving on: Wednesday, January 5, 2011 - 2:44:01 AM

File

ISCO_Simonin.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-00522986, version 1

Collections

Citation

Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König. Polynomial-Time Algorithms for Scheduling Problem for Coupled-Tasks in Presence of Treatment Tasks. ISCO: International Symposium on Combinatorial Optimization, Mar 2010, Hammamet, Tunisia. pp.647-654. ⟨lirmm-00522986⟩

Share

Metrics

Record views

208

Files downloads

380