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
Journal Articles Electronic Notes in Discrete Mathematics 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 specific coupled-tasks scheduling problem.

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⟩
66 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More