<?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-01306519</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-23T11:33:13+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">An effective branch-and-price algorithm for the Preemptive Resource Constrained Project Scheduling Problem based on minimal Interval Order Enumeration</title>
            <author role="aut">
              <persName>
                <forename type="first">Aziz</forename>
                <surname>Moukrim</surname>
              </persName>
              <email type="md5">a1e1fc0e8ce316c923d9357fe47f07cb</email>
              <email type="domain">hds.utc.fr</email>
              <idno type="idhal" notation="string">aziz-moukrim</idno>
              <idno type="idhal" notation="numeric">8097</idno>
              <idno type="halauthorid" notation="string">24681-8097</idno>
              <idno type="IDREF">https://www.idref.fr/075033372</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-0151-6327</idno>
              <affiliation ref="#struct-244047"/>
              <affiliation ref="#struct-389870"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Alain</forename>
                <surname>Quilliot</surname>
              </persName>
              <idno type="idhal" notation="numeric">1320957</idno>
              <idno type="halauthorid" notation="string">622552-1320957</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-6879-5669</idno>
              <affiliation ref="#struct-857"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Hélène</forename>
                <surname>Toussaint</surname>
              </persName>
              <email type="md5">776ce73d9f96872049c22b35613ab552</email>
              <email type="domain">isima.fr</email>
              <idno type="idhal" notation="string">helene-toussaint</idno>
              <idno type="idhal" notation="numeric">17693</idno>
              <idno type="halauthorid" notation="string">14704-17693</idno>
              <idno type="ORCID">https://orcid.org/0009-0008-5178-5860</idno>
              <affiliation ref="#struct-857"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hélène</forename>
                <surname>Toussaint</surname>
              </persName>
              <email type="md5">776ce73d9f96872049c22b35613ab552</email>
              <email type="domain">isima.fr</email>
            </editor>
            <funder ref="#projanr-26414"/>
            <funder ref="#projanr-36353"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2025-01-08 10:57:16</date>
              <date type="whenWritten">2015</date>
              <date type="whenModified">2025-06-24 10:16:03</date>
              <date type="whenReleased">2025-01-10 15:35:31</date>
              <date type="whenProduced">2015</date>
              <date type="whenEndEmbargoed">2025-01-08</date>
              <ref type="file" target="https://hal.science/hal-01306519v1/document">
                <date notBefore="2025-01-08"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01306519v1/file/article-PRCPSP_Octobre2013.pdf" id="file-4873070-4242419">
                <date notBefore="2025-01-08"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="595158">
                <persName>
                  <forename>Hélène</forename>
                  <surname>Toussaint</surname>
                </persName>
                <email type="md5">776ce73d9f96872049c22b35613ab552</email>
                <email type="domain">isima.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01306519</idno>
            <idno type="halUri">https://hal.science/hal-01306519</idno>
            <idno type="halBibtex">moukrim:hal-01306519</idno>
            <idno type="halRefHtml">&lt;i&gt;European Journal of Operational Research&lt;/i&gt;, 2015, 244 (2), pp.360-368. &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.ejor.2014.12.037"&gt;&amp;#x27E8;10.1016/j.ejor.2014.12.037&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">European Journal of Operational Research, 2015, 244 (2), pp.360-368. &amp;#x27E8;10.1016/j.ejor.2014.12.037&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-4873070-4242419"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="PRES_CLERMONT">Université de Clermont</idno>
            <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="UNIV-CLERMONT1" corresp="PRES_CLERMONT">Université d'Auvergne - Clermont-Ferrand I</idno>
            <idno type="stamp" n="UNIV-BPCLERMONT" corresp="PRES_CLERMONT">Université Blaise Pascal - Clermont-Ferrand II</idno>
            <idno type="stamp" n="LIMOS" corresp="PRES_CLERMONT">Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes</idno>
            <idno type="stamp" n="HEUDIASYC" corresp="UNIV-COMPIEGNE">Laboratoire HEUDIASYC - Heuristique et Diagnostic des Systèmes Complexes</idno>
            <idno type="stamp" n="RO" corresp="HEUDIASYC">Réseaux, Optimisation</idno>
            <idno type="stamp" n="MS2T" corresp="UNIV-COMPIEGNE">Laboratoire d'Excellence MS2T - Maîtrise des Systèmes de Systèmes Technologiques</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="ANR">ANR</idno>
            <idno type="stamp" n="CLERMONT-AUVERGNE-INP">Clermont Auvergne INP</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">An effective branch-and-price algorithm for the Preemptive Resource Constrained Project Scheduling Problem based on minimal Interval Order Enumeration</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Aziz</forename>
                    <surname>Moukrim</surname>
                  </persName>
                  <email type="md5">a1e1fc0e8ce316c923d9357fe47f07cb</email>
                  <email type="domain">hds.utc.fr</email>
                  <idno type="idhal" notation="string">aziz-moukrim</idno>
                  <idno type="idhal" notation="numeric">8097</idno>
                  <idno type="halauthorid" notation="string">24681-8097</idno>
                  <idno type="IDREF">https://www.idref.fr/075033372</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-0151-6327</idno>
                  <affiliation ref="#struct-244047"/>
                  <affiliation ref="#struct-389870"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Alain</forename>
                    <surname>Quilliot</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">1320957</idno>
                  <idno type="halauthorid" notation="string">622552-1320957</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-6879-5669</idno>
                  <affiliation ref="#struct-857"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Hélène</forename>
                    <surname>Toussaint</surname>
                  </persName>
                  <email type="md5">776ce73d9f96872049c22b35613ab552</email>
                  <email type="domain">isima.fr</email>
                  <idno type="idhal" notation="string">helene-toussaint</idno>
                  <idno type="idhal" notation="numeric">17693</idno>
                  <idno type="halauthorid" notation="string">14704-17693</idno>
                  <idno type="ORCID">https://orcid.org/0009-0008-5178-5860</idno>
                  <affiliation ref="#struct-857"/>
                </author>
              </analytic>
              <monogr>
                <idno type="localRef">5</idno>
                <idno type="halJournalId" status="VALID">13070</idno>
                <idno type="issn">0377-2217</idno>
                <idno type="eissn">1872-6860</idno>
                <title level="j">European Journal of Operational Research</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">244</biblScope>
                  <biblScope unit="issue">2</biblScope>
                  <biblScope unit="pp">360-368</biblScope>
                  <date type="datePub">2015</date>
                  <date type="dateEpub">2015</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1016/j.ejor.2014.12.037</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Antichain</term>
                <term xml:lang="en">Constraint propagation</term>
                <term xml:lang="en">Column generation</term>
                <term xml:lang="en">Interval order</term>
                <term xml:lang="en">Project scheduling</term>
              </keywords>
              <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="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>In this paper we address the Preemptive Resource Constrained Project Scheduling Problem (PRCPSP). PRCPSP requires a partially ordered set of activities to be scheduled using limited renewable resources such that any activity can be interrupted and later resumed without penalty. The objective is to minimize the project duration. This paper proposes an effective branch-and-price algorithm for solving PRCPSP based upon minimal Interval Order Enumeration involving column generation as well as constraint propagation. Experiments conducted on various types of instances have given very satisfactory results. Our algorithm is able to solve to optimality the entire set of J30, BL and Pack instances while satisfying the preemptive requirement. Furthermore, this algorithm provides improved best-known lower bounds for some of the J60, J90 and J120 instances in the non-preemptive case (RCPSP).</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-244047" status="VALID">
          <orgName>Laboratoire d'Excellence "Maîtrise des Systèmes de Systèmes Technologiques"</orgName>
          <orgName type="acronym">Labex MS2T</orgName>
          <desc>
            <address>
              <addrLine>Université de Technologie de Compiègne - Centre de Recherche de Royallieu - rue du Docteur Schweitzer- CS 60319 - 60203 COMPIEGNE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.utc.fr/labexms2t</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93027" type="direct"/>
            <relation active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <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-857" status="OLD">
          <idno type="IdRef">155645919</idno>
          <idno type="RNSR">200212221E</idno>
          <orgName>Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes</orgName>
          <orgName type="acronym">LIMOS</orgName>
          <date type="start">2000-01-01</date>
          <date type="end">2016-12-31</date>
          <desc>
            <address>
              <addrLine>Bât ISIMA Campus des Cézeaux BP 10025 63173 AUBIERE cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.isima.fr/limos/</ref>
          </desc>
          <listRelation>
            <relation name="UMR6158 / FRE2239" active="#struct-205618" type="direct"/>
            <relation active="#struct-300267" type="direct"/>
            <relation active="#struct-322672" type="direct"/>
            <relation name="UMR6158" active="#struct-359750" type="direct"/>
            <relation name="UMR6158" active="#struct-441569" 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-205618" status="OLD">
          <orgName>Université Blaise Pascal - Clermont-Ferrand 2</orgName>
          <orgName type="acronym">UBP</orgName>
          <date type="end">2016-12-31</date>
          <desc>
            <address>
              <addrLine>34, avenue Carnot - BP 185 / 63006 Clermont-Ferrand cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-bpclermont.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300267" status="OLD">
          <orgName>Université d'Auvergne - Clermont-Ferrand I</orgName>
          <orgName type="acronym">UdA</orgName>
          <date type="end">2016-12-31</date>
          <desc>
            <address>
              <addrLine>49, Boulevard François-Mitterrand / CS 60032 / 63001 Clermont-Ferrand Cedex 1</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-clermont1.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-322672" status="OLD">
          <orgName>SIGMA Clermont</orgName>
          <orgName type="acronym">SIGMA Clermont</orgName>
          <date type="start">2016-01-01</date>
          <date type="end">2020-12-31</date>
          <desc>
            <address>
              <addrLine>SIGMA Clermont / Campus des Cézeaux  / CS 20265 / 63178 Aubière Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sigma-clermont.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-359750" status="VALID">
          <idno type="IdRef">028028694</idno>
          <orgName>Ecole Nationale Supérieure des Mines de St Etienne</orgName>
          <orgName type="acronym">ENSM ST-ETIENNE</orgName>
          <date type="start">1816-01-01</date>
          <desc>
            <address>
              <addrLine>158 Cour Fauriel, 42100 Saint-Étienne</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.mines-stetienne.fr/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-26414" status="VALID">
          <idno type="anr">ANR-11-IDEX-0004</idno>
          <orgName>SUPER</orgName>
          <desc>Sorbonne Universités à Paris pour l'Enseignement et la Recherche</desc>
          <date type="start">2011</date>
        </org>
        <org type="anrProject" xml:id="projanr-36353" status="VALID">
          <idno type="anr">ANR-13-BS02-0006</idno>
          <idno type="program">Blanc 2013</idno>
          <orgName>ATHENA</orgName>
          <desc>Méthodes d'optimisation pour l'étude intégrée de problèmes décisionnels complexes</desc>
          <date type="start">2013</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>