<?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-00170394</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-03T21:53:46+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Worst-Case Evaluation of Flexible Solutions in Disjunctive Scheduling Problems</title>
            <author role="aut">
              <persName>
                <forename type="first">Mohamed Ali</forename>
                <surname>Aloulou</surname>
              </persName>
              <email type="md5">e055f9df1a4d4984816afb47fb936f4f</email>
              <email type="domain">loria.fr</email>
              <idno type="idhal" notation="numeric">835392</idno>
              <idno type="halauthorid" notation="string">168167-835392</idno>
              <affiliation ref="#struct-989"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Christian</forename>
                <surname>Artigues</surname>
              </persName>
              <email type="md5">bc47692c4b7fda3fb0169b407b2078d7</email>
              <email type="domain">laas.fr</email>
              <idno type="idhal" notation="string">christian-artigues</idno>
              <idno type="idhal" notation="numeric">15435</idno>
              <idno type="halauthorid" notation="string">3154-15435</idno>
              <idno type="IDREF">https://www.idref.fr/150656750</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-9766-9864</idno>
              <orgName ref="#struct-395452"/>
              <affiliation ref="#struct-100376"/>
              <affiliation ref="#struct-21884"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Christian</forename>
                <surname>Artigues</surname>
              </persName>
              <email type="md5">bc47692c4b7fda3fb0169b407b2078d7</email>
              <email type="domain">laas.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2007-09-07 15:53:16</date>
              <date type="whenModified">2025-06-13 11:38:14</date>
              <date type="whenReleased">2007-09-07 16:07:21</date>
              <date type="whenProduced">2007</date>
              <date type="whenEndEmbargoed">2007-09-07</date>
              <ref type="file" target="https://hal.science/hal-00170394v1/document">
                <date notBefore="2007-09-07"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-00170394v1/file/AloulouArtiguesOTA.pdf" id="file-170394-527600">
                <date notBefore="2007-09-07"/>
              </ref>
              <ref type="externalLink" target="https://hal.archives-ouvertes.fr/hal-00170394/document"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="113381">
                <persName>
                  <forename>Christian</forename>
                  <surname>Artigues</surname>
                </persName>
                <email type="md5">bc47692c4b7fda3fb0169b407b2078d7</email>
                <email type="domain">laas.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00170394</idno>
            <idno type="halUri">https://hal.science/hal-00170394</idno>
            <idno type="halBibtex">aloulou:hal-00170394</idno>
            <idno type="halRefHtml">&lt;i&gt;International Conference on Computational Science and its Applications (ICCSA 2007)&lt;/i&gt;, 2007, Kuala Lumpur, Malaysia. pp.1027-1038, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-540-74484-9_89"&gt;&amp;#x27E8;10.1007/978-3-540-74484-9_89&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">International Conference on Computational Science and its Applications (ICCSA 2007), 2007, Kuala Lumpur, Malaysia. pp.1027-1038, &amp;#x27E8;10.1007/978-3-540-74484-9_89&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-170394-527600"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-AVIGNON">Université d'Avignon</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-DAUPHINE">Université Paris Dauphine - Paris IX</idno>
            <idno type="stamp" n="LAMSADE-DAUPHINE" corresp="UNIV-DAUPHINE">LAMSADE (Laboratoire d'Analyse et de Modélisation des Systèmes pour l'Aide à la Décision)</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="PSL">Université Paris sciences et lettres</idno>
            <idno type="stamp" n="LIA" corresp="UNIV-AVIGNON">Laboratoire Informatique d'Avignon</idno>
            <idno type="stamp" n="UNIV-DAUPHINE-PSL" corresp="PSL">Université Paris Dauphine - PSL</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">Worst-Case Evaluation of Flexible Solutions in Disjunctive Scheduling Problems</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Mohamed Ali</forename>
                    <surname>Aloulou</surname>
                  </persName>
                  <email type="md5">e055f9df1a4d4984816afb47fb936f4f</email>
                  <email type="domain">loria.fr</email>
                  <idno type="idhal" notation="numeric">835392</idno>
                  <idno type="halauthorid" notation="string">168167-835392</idno>
                  <affiliation ref="#struct-989"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Christian</forename>
                    <surname>Artigues</surname>
                  </persName>
                  <email type="md5">bc47692c4b7fda3fb0169b407b2078d7</email>
                  <email type="domain">laas.fr</email>
                  <idno type="idhal" notation="string">christian-artigues</idno>
                  <idno type="idhal" notation="numeric">15435</idno>
                  <idno type="halauthorid" notation="string">3154-15435</idno>
                  <idno type="IDREF">https://www.idref.fr/150656750</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-9766-9864</idno>
                  <orgName ref="#struct-395452"/>
                  <affiliation ref="#struct-100376"/>
                  <affiliation ref="#struct-21884"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Computational Science and Its Applications – ICCSA 2007</title>
                <meeting>
                  <title>International Conference on Computational Science and its Applications (ICCSA 2007)</title>
                  <date type="start">2007</date>
                  <settlement>Kuala Lumpur</settlement>
                  <country key="MY">Malaysia</country>
                </meeting>
                <editor>O. Gervasi and M. Gavrilova</editor>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">4707</biblScope>
                  <biblScope unit="pp">1027-1038</biblScope>
                  <date type="datePub">2007</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-540-74484-9_89</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Scheduling</term>
                <term xml:lang="en">flexibility</term>
                <term xml:lang="en">worst case performance</term>
                <term xml:lang="en">flow-shop</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</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>In this paper, we consider the problem of evaluating the worst case performance of flexible solutions in non-preemptive disjunctive scheduling. A flexible solution represents a set of semi-active schedules and is characterized by a partial order on each machine. A flexible solution can be used on-line to absorb the impact of some data disturbances related for example to job arrival, tool availability and machine breakdowns. Providing a flexible solution is useful in practice only if it can be assorted with an evaluation of the complete schedules that can be obtained by extension. For this purpose, we suggest to use only the best case and the worst case performance. The best case performance is an ideal performance that can be achieved only if the on-line conditions allow to implement the best schedule among the set of schedules characterized by the flexible solution. In contrast, the worst case performance indicates how poorly the flexible solution may perform. These performances can be obtained by solving corresponding minimization and maximization problems. We focus here on maximization problems when a regular minmax objective function is considered. In this case, the worse objective function value can be determined by computing the worse completion time of each operation separately. We show that this problem can be solved by finding an elementary longest path in the disjunctive graph representing the problem with additional constraints. In the special case of the flow-shop problem with release dates and additional precedence constraints, we give a polynomial algorithm that determines the worst case performance of a flexible solution.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-989" status="VALID">
          <idno type="IdRef">030107156</idno>
          <idno type="ISNI">0000 0001 2097 7052</idno>
          <idno type="RNSR">201120462Y</idno>
          <idno type="ROR">https://ror.org/052bz7812</idno>
          <idno type="Wikidata">Q3214405</idno>
          <orgName>Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision</orgName>
          <orgName type="acronym">LAMSADE</orgName>
          <desc>
            <address>
              <addrLine>Place de Lattre de Tassigny 75775 PARIS CEDEX 16</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lamsade.dauphine.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300302" type="direct"/>
            <relation active="#struct-564132" type="indirect"/>
            <relation name="UMR7243 / FRE3234 / UMR7024" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-100376" status="VALID">
          <orgName>Laboratoire Informatique d'Avignon</orgName>
          <orgName type="acronym">LIA</orgName>
          <desc>
            <address>
              <addrLine>339 Chemin des Meinajaries Agroparc BP 1228 84911 Avignon cedex 9</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://lia.univ-avignon.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-195507" type="direct"/>
            <relation active="#struct-302221" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-21884" status="INCOMING">
          <orgName>Centre de Recherche sur les Transports</orgName>
          <orgName type="acronym">CRT</orgName>
          <desc>
            <address>
              <addrLine>C.P. 6128, succursale Centre-ville, Montréal, QC H3C 3J7 Canada</addrLine>
              <country key="CA"/>
            </address>
            <ref type="url">http://www.crt.umontreal.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-302452" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300302" status="VALID">
          <idno type="IdRef">027787109</idno>
          <idno type="ISNI">0000000120977052</idno>
          <idno type="ROR">https://ror.org/052bz7812</idno>
          <idno type="Wikidata">Q1546437</idno>
          <orgName>Université Paris Dauphine-PSL</orgName>
          <desc>
            <address>
              <addrLine>Place du Maréchal de Lattre de Tassigny75775 PARIS Cedex 16</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://dauphine.psl.eu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-564132" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-564132" status="VALID">
          <idno type="IdRef">241597595</idno>
          <idno type="ISNI">0000 0004 1784 3645</idno>
          <idno type="ROR">https://ror.org/013cjyk83</idno>
          <orgName>Université Paris Sciences et Lettres</orgName>
          <orgName type="acronym">PSL</orgName>
          <desc>
            <address>
              <addrLine>60 rue Mazarine 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.psl.eu/</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>
        <org type="institution" xml:id="struct-195507" status="VALID">
          <idno type="ROR">https://ror.org/00mfpxb84</idno>
          <orgName>Avignon Université</orgName>
          <orgName type="acronym">AU</orgName>
          <desc>
            <address>
              <addrLine>74 rue Louis Pasteur - 84 029 Avignon cedex 1</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-avignon.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-302221" status="VALID">
          <orgName>Centre d'Enseignement et de Recherche en Informatique - CERI</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-302452" status="VALID">
          <idno type="ROR">https://ror.org/0161xgx34</idno>
          <orgName>Université de Montréal</orgName>
          <orgName type="acronym">UdeM</orgName>
          <desc>
            <address>
              <addrLine>2900 Boulevard Edouard-Montpetit, Montréal, QC H3T 1J4</addrLine>
              <country key="CA"/>
            </address>
            <ref type="url">https://www.umontreal.ca/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>