Scheduling coupled-tasks with incompatibility constraint: a bin-packing related problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Scheduling coupled-tasks with incompatibility constraint: a bin-packing related problem

Résumé

We tackle the makespan minimization problem of coupled- tasks in presence of compatibility constraint. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We show the relationship with bin packing problems for some configurations, and study several problems in framework of complexity and approximation for which the topology of the compatibility graph is specific (star, chain, bipartite, . . .).
Fichier principal
Vignette du fichier
BPPC_14.pdf (119.8 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01005429 , version 1 (12-06-2014)

Identifiants

  • HAL Id : hal-01005429 , version 1

Citer

Gilles Simonin, Benoit Darties, Rodolphe Giroudeau, Jean-Claude König. Scheduling coupled-tasks with incompatibility constraint: a bin-packing related problem. BPPC: Bin Packing and Placement Constraints, May 2014, Cork, Ireland. ⟨hal-01005429⟩
350 Consultations
172 Téléchargements

Partager

Gmail Facebook X LinkedIn More