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

Abstract : 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, . . .).
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01005429
Contributor : Benoît Darties <>
Submitted on : Thursday, June 12, 2014 - 3:51:05 PM
Last modification on : Monday, February 11, 2019 - 11:50:15 AM
Document(s) archivé(s) le : Friday, September 12, 2014 - 11:30:12 AM

File

BPPC_14.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01005429, version 1

Citation

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⟩

Share

Metrics

Record views

457

Files downloads

225