Polynomial-Time Algorithms for Scheduling Problem for Coupled-Tasks in Presence of Treatment Tasks - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2010

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

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.
Fichier principal
Vignette du fichier
ISCO_Simonin.pdf (168.8 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

lirmm-00522986 , version 1 (04-10-2010)

Identifiers

  • HAL Id : lirmm-00522986 , version 1

Cite

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⟩
114 View
387 Download

Share

Gmail Mastodon Facebook X LinkedIn More