Complexity and Approximation for Scheduling Problem for Coupled-Tasks in Presence of Compatibility Tasks - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2010

Complexity and Approximation for Scheduling Problem for Coupled-Tasks in Presence of Compatibility Tasks

Abstract

In this paper, we study a scheduling problem with compled-tasks in presence of incompatible constraint. We give complexity results and a polynomial-time approximation for a specific problem when the compatibility graph has different topologies.
Fichier principal
Vignette du fichier
PMS2010-Simonin.pdf (121.64 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

lirmm-00488279 , version 1 (01-06-2010)

Identifiers

  • HAL Id : lirmm-00488279 , version 1

Cite

Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König. Complexity and Approximation for Scheduling Problem for Coupled-Tasks in Presence of Compatibility Tasks. PMS: Project Management and Scheduling, Apr 2010, Tours, France. pp.371-374. ⟨lirmm-00488279⟩
130 View
145 Download

Share

Gmail Mastodon Facebook X LinkedIn More