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
Journal Articles Electronic Notes in Discrete Mathematics Year : 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

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

Domains

Operations Research [math.OC]

Gilles Simonin  : Connect in order to contact the contributor

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

Submitted on : Monday, October 4, 2010-10:46:50 AM

Last modification on : Friday, March 24, 2023-2:52:53 PM

Consult on ISTEX platform

Dates and versions

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

Identifiers

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS MAORE LIRMM MIPS UNIV-MONTPELLIER
67 View
0 Download

Altmetric

Share

More