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 Accéder directement au contenu
Article Dans Une Revue Electronic Notes in Discrete Mathematics Année : 2010

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

Gilles Simonin
Methods, Algorithms for Operations REsearch
Rodolphe Giroudeau
Methods, Algorithms for Operations REsearch
CV
Jean-Claude König
Methods, Algorithms for Operations REsearch
CV

Résumé

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 specific coupled-tasks scheduling problem.

Domaines

Recherche opérationnelle [math.OC]

Gilles Simonin  : Connectez-vous pour contacter le contributeur

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00522993

Soumis le : lundi 4 octobre 2010-10:46:50

Dernière modification le : vendredi 24 mars 2023-14:52:53

Consulter sur la plateforme ISTEX

Dates et versions

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

Identifiants

Citer

Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König. Polynomial-Time Algorithms for Scheduling Problem for Coupled-Tasks in Presence of Treatment Tasks. Electronic Notes in Discrete Mathematics, 2010, 36, pp.647-654. ⟨10.1016/j.endm.2010.05.082⟩. ⟨lirmm-00522993⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS MAORE LIRMM MIPS UNIV-MONTPELLIER
65 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More