6533b7d9fe1ef96bd126d43b

RESEARCH PRODUCT

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

Gilles Simonin Benoit Darties Rodolphe Giroudeau Jean-claude König

subject

[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO][INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO][ INFO.INFO-RO ] Computer Science [cs]/Operations Research [cs.RO]

description

International audience; 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, . . .).

https://hal.archives-ouvertes.fr/hal-01005429/file/BPPC_14.pdf