Scheduling stretched coupled-tasks with compatibilities constraints : model, complexity and approximation results for some class of graphs
type: Dataset
description: We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, {\it i.e.}coupled-tasks having the same sub-tasks execution time and idle time duration. We study severals problems in frame works of classic complexity and approximation for which the compatibility graph $G_c$ is bipartite (star, chain, $\ldots$) In such context, we design some efficient polynomial-time approximation algorithms according to difference parameters of the scheduling problem. When $G_c$ is a $k$-stage bipartite graph, we propose, among other, a $\frac{7}{6}$-approximation algorithm when $k=1$, and a $\frac{13}{9}$-approximation algorithm when $k=2$.\\
landing page: https://hal.science/hal-00947519
keyword: approximation-algorithm
keyword: compatibility-graph
keyword: complexity
keyword: coupled-tasks
keyword: infoeu-reposemanticsreport
keyword: infoinfo-cccomputer-science-cscomputational-complexity-cscc
keyword: reports
keyword: scheduling
issued: 2026-05-06T09:03:08.527048
modified: 2026-05-06T09:03:08.527052
language: en
contact point: Organization
  fn: CCSD

test_moissonnage_selune
type: Agent

Scheduling stretched coupled-tasks with compatibilities constraints : model, complexity and approximation results for some class of graphs
type: Distribution
format: HTML
access URL: https://hal.science/hal-00947519
issued: 2026-05-06T09:03:08.530121
modified: 2026-05-06T09:03:08.516072