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

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

doi:10.1016/j.endm.2010.05.082

Back

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

Journal article

Peer reviewed

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

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

Electronic Notes in Discrete Mathematics, Vol.36, pp.647-654

17/07/2010

DOI: https://doi.org/10.1016/j.endm.2010.05.082

Abstract

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

Files and links (1)

url

Find in HALView

Metrics

1 Record Views

Details

Title: Polynomial-Time Algorithms for Scheduling Problem for Coupled-Tasks in Presence of Treatment Tasks
Creators - without role: Gilles Simonin - Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier
Rodolphe Giroudeau - Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier
Jean-Claude König - Methods, Algorithms for Operations REsearch
Publication Details: Electronic Notes in Discrete Mathematics, Vol.36, pp.647-654
Identifiers: 9942191009311
Academic Unit: Laboratoire d'Informatique de Robotique et de Microélectronique de Mtp - LIRMM
Language: English
Resource Type: Journal article
Local Fields: lirmm-00522993