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

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

Retour

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

Acte de colloque

Open Access

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

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

12th International Workshop on Project Management and Scheduling, pp.371-374

PMS: Project Management and Scheduling (Tours, France, 26/04/2010–28/04/2010)

28/04/2010

Résumé

Graph

Approximation

Complexity

Coupled-tasks

Scheduling

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.

Fichiers et liens (1)

url

Find in HALAfficher

Indicateurs

1 Consultations de la notice

Détails

Titre: Complexity and Approximation for Scheduling Problem for Coupled-Tasks in Presence of Compatibility Tasks
Créateurs - sans rôle: Gilles Simonin - Methods, Algorithms for Operations REsearch
Rodolphe Giroudeau - Methods, Algorithms for Operations REsearch
Jean-Claude König - Methods, Algorithms for Operations REsearch
Détails de publication: 12th International Workshop on Project Management and Scheduling, pp.371-374
Colloque: PMS: Project Management and Scheduling (Tours, France, 26/04/2010–28/04/2010)
Identifiants: 99150796109311
Unité académique: Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier - LIRMM
Langue: English
Type de ressource: Conference proceeding
Champs locaux: lirmm-00488279