<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-02277357</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-22T16:49:00+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Approximation results for makespan minimization with budgeted uncertainty</title>
            <author role="aut">
              <persName>
                <forename type="first">Marin</forename>
                <surname>Bougeret</surname>
              </persName>
              <email type="md5">866ea4828811774358e36f187ffc2c9c</email>
              <email type="domain">imag.fr</email>
              <idno type="idhal" notation="string">marin-bougeret</idno>
              <idno type="idhal" notation="numeric">10167</idno>
              <idno type="halauthorid" notation="string">17678-10167</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-9910-4656</idno>
              <idno type="IDREF">https://www.idref.fr/197511686</idno>
              <affiliation ref="#struct-388229"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Klaus</forename>
                <surname>Jansen</surname>
              </persName>
              <idno type="halauthorid">271659-0</idno>
              <affiliation ref="#struct-462123"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Michael</forename>
                <surname>Poss</surname>
              </persName>
              <email type="md5">72e27cfcfe136fce3f5a53c76020e9d3</email>
              <email type="domain">hds.utc.fr</email>
              <idno type="idhal" notation="string">michael-poss</idno>
              <idno type="idhal" notation="numeric">170284</idno>
              <idno type="halauthorid" notation="string">27682-170284</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-9145-2525</idno>
              <idno type="IDREF">https://www.idref.fr/183981847</idno>
              <affiliation ref="#struct-388266"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Lars</forename>
                <surname>Rohwedder</surname>
              </persName>
              <idno type="halauthorid">1643814-0</idno>
              <affiliation ref="#struct-462123"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Marin</forename>
                <surname>Bougeret</surname>
              </persName>
              <email type="md5">746e62a89c5ae8d3b9881df007294416</email>
              <email type="domain">lirmm.fr</email>
            </editor>
            <funder ref="#projanr-44739"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2019-09-03 15:21:15</date>
              <date type="whenModified">2024-02-23 17:04:04</date>
              <date type="whenReleased">2019-09-04 14:17:50</date>
              <date type="whenProduced">2019-09-12</date>
              <date type="whenEndEmbargoed">2019-09-03</date>
              <ref type="file" target="https://hal.science/hal-02277357v1/document">
                <date notBefore="2019-09-03"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-02277357v1/file/submission.pdf" id="file-2277357-2198563">
                <date notBefore="2019-09-03"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1905.08592"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="136788">
                <persName>
                  <forename>Marin</forename>
                  <surname>Bougeret</surname>
                </persName>
                <email type="md5">746e62a89c5ae8d3b9881df007294416</email>
                <email type="domain">lirmm.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02277357</idno>
            <idno type="halUri">https://hal.science/hal-02277357</idno>
            <idno type="halBibtex">bougeret:hal-02277357</idno>
            <idno type="halRefHtml">&lt;i&gt;WAOA 2019 - 17th International Workshop on Approximation and Online Algorithms&lt;/i&gt;, Sep 2019, Munich, Germany. pp.60-71, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-030-39479-0_5"&gt;&amp;#x27E8;10.1007/978-3-030-39479-0_5&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">WAOA 2019 - 17th International Workshop on Approximation and Online Algorithms, Sep 2019, Munich, Germany. pp.60-71, &amp;#x27E8;10.1007/978-3-030-39479-0_5&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-2277357-2198563"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="MAORE" corresp="LIRMM">Méthodes Algorithmes pour l'Ordonnancement et les Réseaux</idno>
            <idno type="stamp" n="ALGCO" corresp="LIRMM">Algorithmes, Graphes et Combinatoire</idno>
            <idno type="stamp" n="LIRMM">Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="MIPS">Mathématiques, Informatique, Physique et Systèmes</idno>
            <idno type="stamp" n="UNIV-MONTPELLIER">Université de Montpellier</idno>
            <idno type="stamp" n="POSS">Michael Poss</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="UM-2015-2021" corresp="UNIV-MONTPELLIER">Université de Montpellier (2015-2021)</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Approximation results for makespan minimization with budgeted uncertainty</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Marin</forename>
                    <surname>Bougeret</surname>
                  </persName>
                  <email type="md5">866ea4828811774358e36f187ffc2c9c</email>
                  <email type="domain">imag.fr</email>
                  <idno type="idhal" notation="string">marin-bougeret</idno>
                  <idno type="idhal" notation="numeric">10167</idno>
                  <idno type="halauthorid" notation="string">17678-10167</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-9910-4656</idno>
                  <idno type="IDREF">https://www.idref.fr/197511686</idno>
                  <affiliation ref="#struct-388229"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Klaus</forename>
                    <surname>Jansen</surname>
                  </persName>
                  <idno type="halauthorid">271659-0</idno>
                  <affiliation ref="#struct-462123"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Michael</forename>
                    <surname>Poss</surname>
                  </persName>
                  <email type="md5">72e27cfcfe136fce3f5a53c76020e9d3</email>
                  <email type="domain">hds.utc.fr</email>
                  <idno type="idhal" notation="string">michael-poss</idno>
                  <idno type="idhal" notation="numeric">170284</idno>
                  <idno type="halauthorid" notation="string">27682-170284</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-9145-2525</idno>
                  <idno type="IDREF">https://www.idref.fr/183981847</idno>
                  <affiliation ref="#struct-388266"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Lars</forename>
                    <surname>Rohwedder</surname>
                  </persName>
                  <idno type="halauthorid">1643814-0</idno>
                  <affiliation ref="#struct-462123"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>WAOA 2019 - 17th International Workshop on Approximation and Online Algorithms</title>
                  <date type="start">2019-09-12</date>
                  <date type="end">2019-09-13</date>
                  <settlement>Munich</settlement>
                  <country key="DE">Germany</country>
                </meeting>
                <imprint>
                  <biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">11926</biblScope>
                  <biblScope unit="pp">60-71</biblScope>
                  <date type="datePub">2020</date>
                </imprint>
              </monogr>
              <idno type="arxiv">1905.08592</idno>
              <idno type="doi">10.1007/978-3-030-39479-0_5</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">unrelated machines</term>
                <term xml:lang="en">parallel machines</term>
                <term xml:lang="en">EPTAS</term>
                <term xml:lang="en">approximation algorithms</term>
                <term xml:lang="en">robust optimization</term>
                <term xml:lang="en">Makespan minimization</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</classCode>
              <classCode scheme="halDomain" n="info.info-cc">Computer Science [cs]/Computational Complexity [cs.CC]</classCode>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</classCode>
              <classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We study approximation algorithms for the problem of minimizing the makespan on a set of machines with uncertainty on the processing times of jobs. In the model we consider, which goes back to [3], once the schedule is defined an adversary can pick a scenario where deviation is added to some of the jobs' processing times. Given only the maximal cardinality of these jobs, and the magnitude of potential deviation for each job, the goal is to optimize the worst-case scenario. We consider both the cases of identical and unrelated machines. Our main result is an EPTAS for the case of identical machines. We also provide a 3-approximation algorithm and an inapproximability ratio of 2 − epsilon for the case of unrelated machines.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-388229" status="OLD">
          <orgName>Algorithmes, Graphes et Combinatoire</orgName>
          <orgName type="acronym">ALGCO</orgName>
          <date type="end">2021-12-31</date>
          <desc>
            <address>
              <addrLine>LIRMM, 161 rue Ada, 34000 Montpellier</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lirmm.fr/equipes/ALGCO/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-181" type="direct"/>
            <relation name="UMR5506" active="#struct-410122" type="indirect"/>
            <relation name="UMR5506" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-462123" status="VALID">
          <idno type="IdRef">027909913</idno>
          <idno type="ISNI">0000000121539986</idno>
          <idno type="ROR">https://ror.org/04v76ef78</idno>
          <orgName>Christian-Albrechts-Universität zu Kiel = Christian-Albrechts University of Kiel = Université Christian-Albrechts de Kiel</orgName>
          <orgName type="acronym">CAU</orgName>
          <desc>
            <address>
              <addrLine>Christian-Albrechts-Platz 4, 24118 Kiel, Germany</addrLine>
              <country key="DE"/>
            </address>
            <ref type="url">http://www.uni-kiel.de/</ref>
          </desc>
        </org>
        <org type="researchteam" xml:id="struct-388266" status="OLD">
          <orgName>Methods, Algorithms for Operations REsearch</orgName>
          <orgName type="acronym">MAORE</orgName>
          <date type="end">2021-12-31</date>
          <desc>
            <address>
              <addrLine>LIRMM, 161 rue Ada, 34000 Montpellier</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lirmm.fr/equipes/MAORE/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-181" type="direct"/>
            <relation name="UMR5506" active="#struct-410122" type="indirect"/>
            <relation name="UMR5506" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-181" status="OLD">
          <idno type="IdRef">139590827</idno>
          <idno type="ISNI">0000000405990488</idno>
          <idno type="RNSR">199111950H</idno>
          <idno type="ROR">https://ror.org/013yean28</idno>
          <orgName>Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier</orgName>
          <orgName type="acronym">LIRMM</orgName>
          <date type="start">1995-01-01</date>
          <date type="end">2021-12-31</date>
          <desc>
            <address>
              <addrLine>161 rue Ada - 34095 Montpellier</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lirmm.fr</ref>
          </desc>
          <listRelation>
            <relation name="UMR5506" active="#struct-410122" type="direct"/>
            <relation name="UMR5506" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-410122" status="OLD">
          <idno type="ISNI">0000000120970141</idno>
          <idno type="ROR">https://ror.org/051escj72</idno>
          <orgName>Université de Montpellier</orgName>
          <orgName type="acronym">UM</orgName>
          <date type="end">2021-12-31</date>
          <desc>
            <address>
              <addrLine>163 rue Auguste Broussonnet - 34090 Montpellier</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.umontpellier.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-44739" status="VALID">
          <idno type="anr">ANR-16-CE40-0018</idno>
          <orgName>ROBUST</orgName>
          <desc>Ordonancement robuste avec durée incertaines pour une incertitude de type budget</desc>
          <date type="start">2016</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>