<?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-00445528</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-17T15:33:18+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Approximate resolution of a resource-constrained scheduling problem</title>
            <author role="aut">
              <persName>
                <forename type="first">Renaud</forename>
                <surname>Sirdey</surname>
              </persName>
              <email type="md5">8b2006fa0adca5e10c8a14b3c3ee4c91</email>
              <email type="domain">cea.fr</email>
              <idno type="idhal" notation="numeric">844622</idno>
              <idno type="halauthorid" notation="string">244131-844622</idno>
              <affiliation ref="#struct-389870"/>
              <affiliation ref="#struct-73329"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jacques</forename>
                <surname>Carlier</surname>
              </persName>
              <email type="md5">88e97bc6953195d28ca4e888b25f5615</email>
              <email type="domain">hds.utc.fr</email>
              <idno type="idhal" notation="string">sahlabde</idno>
              <idno type="idhal" notation="numeric">7031</idno>
              <idno type="halauthorid" notation="string">187530-7031</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-1528-4849</idno>
              <idno type="IDREF">https://www.idref.fr/224190962</idno>
              <affiliation ref="#struct-389870"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Dritan</forename>
                <surname>Nace</surname>
              </persName>
              <email type="md5">9d0dc118281145efcee507c611f2fff8</email>
              <email type="domain">hds.utc.fr</email>
              <idno type="idhal" notation="numeric">852782</idno>
              <idno type="halauthorid" notation="string">339324-852782</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-3914-2463</idno>
              <affiliation ref="#struct-389870"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Dritan</forename>
                <surname>Nace</surname>
              </persName>
              <email type="md5">59864c9e12dd29a9abc7d41d6a804488</email>
              <email type="domain">utc.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2010-01-08 18:11:54</date>
              <date type="whenModified">2025-06-24 10:16:03</date>
              <date type="whenReleased">2010-01-08 18:11:54</date>
              <date type="whenProduced">2009-02-01</date>
              <ref type="externalLink" target="http://sirdeyre.free.fr/Papiers_etc/2009_Approximate_resolution_of_a_resource-constrained_scheduling_problem.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="134451">
                <persName>
                  <forename>Dritan</forename>
                  <surname>Nace</surname>
                </persName>
                <email type="md5">59864c9e12dd29a9abc7d41d6a804488</email>
                <email type="domain">utc.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00445528</idno>
            <idno type="halUri">https://hal.science/hal-00445528</idno>
            <idno type="halBibtex">sirdey:hal-00445528</idno>
            <idno type="halRefHtml">&lt;i&gt;Journal of Heuristics&lt;/i&gt;, 2009, Volume 15 (Number 1), pp 1-17. &lt;a target="_blank" href="https://dx.doi.org/10.1007/s10732-007-9052-0"&gt;&amp;#x27E8;10.1007/s10732-007-9052-0&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Journal of Heuristics, 2009, Volume 15 (Number 1), pp 1-17. &amp;#x27E8;10.1007/s10732-007-9052-0&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-COMPIEGNE">Université de Technologie de Compiègne</idno>
            <idno type="stamp" n="HEUDIASYC" corresp="UNIV-COMPIEGNE">Laboratoire HEUDIASYC - Heuristique et Diagnostic des Systèmes Complexes</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="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Approximate resolution of a resource-constrained scheduling problem</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Renaud</forename>
                    <surname>Sirdey</surname>
                  </persName>
                  <email type="md5">8b2006fa0adca5e10c8a14b3c3ee4c91</email>
                  <email type="domain">cea.fr</email>
                  <idno type="idhal" notation="numeric">844622</idno>
                  <idno type="halauthorid" notation="string">244131-844622</idno>
                  <affiliation ref="#struct-389870"/>
                  <affiliation ref="#struct-73329"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jacques</forename>
                    <surname>Carlier</surname>
                  </persName>
                  <email type="md5">88e97bc6953195d28ca4e888b25f5615</email>
                  <email type="domain">hds.utc.fr</email>
                  <idno type="idhal" notation="string">sahlabde</idno>
                  <idno type="idhal" notation="numeric">7031</idno>
                  <idno type="halauthorid" notation="string">187530-7031</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-1528-4849</idno>
                  <idno type="IDREF">https://www.idref.fr/224190962</idno>
                  <affiliation ref="#struct-389870"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Dritan</forename>
                    <surname>Nace</surname>
                  </persName>
                  <email type="md5">9d0dc118281145efcee507c611f2fff8</email>
                  <email type="domain">hds.utc.fr</email>
                  <idno type="idhal" notation="numeric">852782</idno>
                  <idno type="halauthorid" notation="string">339324-852782</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-3914-2463</idno>
                  <affiliation ref="#struct-389870"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">13969</idno>
                <idno type="issn">1381-1231</idno>
                <idno type="eissn">1572-9397</idno>
                <title level="j">Journal of Heuristics</title>
                <imprint>
                  <publisher>Springer Verlag</publisher>
                  <biblScope unit="volume">Volume 15</biblScope>
                  <biblScope unit="issue">Number 1</biblScope>
                  <biblScope unit="pp">pp 1-17</biblScope>
                  <date type="datePub">2009-02-01</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/s10732-007-9052-0</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Combinatorial optimization</term>
                <term xml:lang="en">Scheduling</term>
                <term xml:lang="en">Simulated annealing</term>
                <term xml:lang="en">Distributed systems</term>
                <term xml:lang="en">OR in telecommunications</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>This paper is devoted to the approximate solution of a strongly NP-hard resource-constrained scheduling problem which arises in relation to the operability of certain high availability real time distributed systems. We present an algorithm based on the simulated annealing metaheuristic and, building on previous research on exact solution methods, extensive computational results demonstrating its practical ability to produce acceptable solutions, in a precisely defined sense. Additionally, our experiments are in remarkable agreement with certain theoretical properties of our simulated annealing scheme. The paper concludes with a short discussion on further research.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-389870" status="VALID">
          <idno type="IdRef">110410807</idno>
          <idno type="ISNI">0000 0004 0452 2471</idno>
          <idno type="RNSR">201220263C</idno>
          <idno type="ROR">https://ror.org/0075hvk77</idno>
          <orgName>Heuristique et Diagnostic des Systèmes Complexes [Compiègne]</orgName>
          <orgName type="acronym">Heudiasyc</orgName>
          <desc>
            <address>
              <addrLine>UTC, CS 60319 - 57 avenue de Landshut - 60203 Compiègne cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.hds.utc.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93027" type="direct"/>
            <relation name="UMR7253" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-73329" status="INCOMING">
          <orgName>Nortel GSM Access</orgName>
          <desc>
            <address>
              <addrLine>Parc d'activités de Magny-Châteaufort, 78928 Yvelines Cedex 09, France</addrLine>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-319635" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93027" status="VALID">
          <idno type="ROR">https://ror.org/04y5kwa70</idno>
          <orgName>Université de Technologie de Compiègne</orgName>
          <orgName type="acronym">UTC</orgName>
          <desc>
            <address>
              <addrLine>Université de Technologie de Compiègne - rue du Docteur Schweitzer- CS 60319 - 60203 Compiègne Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.utc.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>
        <org type="institution" xml:id="struct-319635" status="INCOMING">
          <orgName>Nortel</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>