@prefix dcat: <http://www.w3.org/ns/dcat#> .
@prefix dct: <http://purl.org/dc/terms/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix vcard: <http://www.w3.org/2006/vcard/ns#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00947519v1> a dcat:Dataset ;
    dct: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$.\\\\
            """ ;
    dct:identifier "hal-00947519" ;
    dct:issued "2026-05-06T09:03:08.527048"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-06T09:03:08.527052"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Scheduling stretched coupled-tasks with compatibilities constraints : model, complexity and approximation results for some class of graphs" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00947519v1/resource/4e7dd963-8113-48f0-9f07-3790b3e845f4> ;
    dcat:keyword "approximation-algorithm",
        "compatibility-graph",
        "complexity",
        "coupled-tasks",
        "infoeu-reposemanticsreport",
        "infoinfo-cccomputer-science-cscomputational-complexity-cscc",
        "reports",
        "scheduling" ;
    dcat:landingPage <https://hal.science/hal-00947519> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00947519v1/resource/4e7dd963-8113-48f0-9f07-3790b3e845f4> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-06T09:03:08.530121"^^xsd:dateTime ;
    dct:modified "2026-05-06T09:03:08.516072"^^xsd:dateTime ;
    dct:title "Scheduling stretched coupled-tasks with compatibilities constraints : model, complexity and approximation results for some class of graphs" ;
    dcat:accessURL <https://hal.science/hal-00947519> .

<https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> a foaf:Agent ;
    foaf:name "test_moissonnage_selune" .

<https://hal.science/hal-00947519> a foaf:Document .