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

Gilles Simonin; Rodolphe Giroudeau; Jean-Claude König

Retour

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

Acte de colloque

Open Access

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

Gilles Simonin, Rodolphe Giroudeau et Jean-Claude König

ISCO: International Symposium on Combinatorial Optimization, pp.647-654

ISCO: International Symposium on Combinatorial Optimization (Hammamet, Tunisia, 24/03/2010–26/03/2010)

17/07/2010

Résumé

Polynomial-time algorithm

scheduling

coupled-tasks

matching

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.

Fichiers et liens (1)

url

Find in HALAfficher

Indicateurs

1 Consultations de la notice

Détails

Titre: Polynomial-Time Algorithms for Scheduling Problem for Coupled-Tasks in Presence of Treatment Tasks
Créateurs - sans rôle: Gilles Simonin - Methods, Algorithms for Operations REsearch
Rodolphe Giroudeau - Methods, Algorithms for Operations REsearch
Jean-Claude König - Methods, Algorithms for Operations REsearch
Détails de publication: ISCO: International Symposium on Combinatorial Optimization, pp.647-654
Colloque: ISCO: International Symposium on Combinatorial Optimization (Hammamet, Tunisia, 24/03/2010–26/03/2010)
Identifiants: 9942195609311
Unité académique: Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier - LIRMM
Langue: English
Type de ressource: Conference proceeding
Champs locaux: lirmm-00522986