<?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-01785935</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-04-29T13:38:41+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut</title>
            <author role="aut">
              <persName>
                <forename type="first">Mohammed-Albarra</forename>
                <surname>Hassan</surname>
              </persName>
              <idno type="halauthorid">1362283-0</idno>
              <affiliation ref="#struct-234725"/>
              <affiliation ref="#struct-316561"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Imed</forename>
                <surname>Kacem</surname>
              </persName>
              <email type="md5">3e9ce0023e50f0967cc322f40f6f5de0</email>
              <email type="domain">univ-lorraine.fr</email>
              <idno type="idhal" notation="string">imed-kacem</idno>
              <idno type="idhal" notation="numeric">8452</idno>
              <idno type="halauthorid" notation="string">14224-8452</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-6649-7257</idno>
              <idno type="IDREF">https://www.idref.fr/070471096</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8365-3004</idno>
              <affiliation ref="#struct-234725"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Sébastien</forename>
                <surname>Martin</surname>
              </persName>
              <email type="md5">ef94b03d5c7bfb421182617d485dbbf3</email>
              <email type="domain">univ-lorraine.fr</email>
              <idno type="idhal" notation="numeric">981883</idno>
              <idno type="halauthorid" notation="string">19710-981883</idno>
              <affiliation ref="#struct-234725"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Izzeldin</forename>
                <surname>Osman</surname>
              </persName>
              <idno type="halauthorid">1362284-0</idno>
              <affiliation ref="#struct-325259"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>LCOMS</forename>
                <surname>UL</surname>
              </persName>
              <email type="md5">95c3a61ffcd4f1ed7e6760bcdeb407a9</email>
              <email type="domain">univ-lorraine.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-05-04 17:14:24</date>
              <date type="whenModified">2025-11-04 12:04:45</date>
              <date type="whenReleased">2018-05-04 17:14:24</date>
              <date type="whenProduced">2016-05-16</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="329564">
                <persName>
                  <forename>LCOMS</forename>
                  <surname>UL</surname>
                </persName>
                <email type="md5">95c3a61ffcd4f1ed7e6760bcdeb407a9</email>
                <email type="domain">univ-lorraine.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01785935</idno>
            <idno type="halUri">https://hal.univ-lorraine.fr/hal-01785935</idno>
            <idno type="halBibtex">hassan:hal-01785935</idno>
            <idno type="halRefHtml">&lt;i&gt; International Symposium on Combinatorial Optimization ISCO 2016: Combinatorial Optimization &lt;/i&gt;, May 2016, Salerne, Italy. pp.308-319</idno>
            <idno type="halRef"> International Symposium on Combinatorial Optimization ISCO 2016: Combinatorial Optimization , May 2016, Salerne, Italy. pp.308-319</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
            <idno type="stamp" n="LCOMS-UL">LCOMS</idno>
            <idno type="stamp" n="AM2I-UL">Pôle scientifique Automatique, Mathématiques, Informatique et leurs Intéractions de l'Université de Lorraine</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="0">No</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Mohammed-Albarra</forename>
                    <surname>Hassan</surname>
                  </persName>
                  <idno type="halauthorid">1362283-0</idno>
                  <affiliation ref="#struct-234725"/>
                  <affiliation ref="#struct-316561"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Imed</forename>
                    <surname>Kacem</surname>
                  </persName>
                  <email type="md5">3e9ce0023e50f0967cc322f40f6f5de0</email>
                  <email type="domain">univ-lorraine.fr</email>
                  <idno type="idhal" notation="string">imed-kacem</idno>
                  <idno type="idhal" notation="numeric">8452</idno>
                  <idno type="halauthorid" notation="string">14224-8452</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-6649-7257</idno>
                  <idno type="IDREF">https://www.idref.fr/070471096</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8365-3004</idno>
                  <affiliation ref="#struct-234725"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Sébastien</forename>
                    <surname>Martin</surname>
                  </persName>
                  <email type="md5">ef94b03d5c7bfb421182617d485dbbf3</email>
                  <email type="domain">univ-lorraine.fr</email>
                  <idno type="idhal" notation="numeric">981883</idno>
                  <idno type="halauthorid" notation="string">19710-981883</idno>
                  <affiliation ref="#struct-234725"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Izzeldin</forename>
                    <surname>Osman</surname>
                  </persName>
                  <idno type="halauthorid">1362284-0</idno>
                  <affiliation ref="#struct-325259"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Combinatorial Optimization. ISCO 2016. Lecture Notes in Computer Science</title>
                <meeting>
                  <title> International Symposium on Combinatorial Optimization  ISCO 2016: Combinatorial Optimization </title>
                  <date type="start">2016-05-16</date>
                  <date type="end">2016-05-18</date>
                  <settlement>Salerne</settlement>
                  <country key="IT">Italy</country>
                </meeting>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="volume">9849</biblScope>
                  <biblScope unit="pp">308-319</biblScope>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Branch-and-Cut</term>
                <term xml:lang="en">Precedence constraints</term>
                <term xml:lang="en">Scheduling</term>
                <term xml:lang="en">Unrelated parallel machines</term>
                <term xml:lang="en">Valid inequalities</term>
                <term xml:lang="en">Polyhedral</term>
              </keywords>
              <classCode scheme="halDomain" n="scco.comp">Cognitive science/Computer science</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 consider the problem of unrelated parallel machines with precedence constraints (UPMPC), with the aim of minimizing the makespan. Each task has to be assigned to a unique machine and no preemption is allowed. In this paper, we show the relation between the interval graph and the UPMSPC problem. We propose valid inequalities and study the facial structure of their polytope. Facets are presented to strength the associated integer linear program formulation to help in solving the global problem. We develop a Branch and Cut algorithm for solving the problem and present some experimental results.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-234725" status="VALID">
          <idno type="IdRef">179233335</idno>
          <idno type="RNSR">201320864B</idno>
          <idno type="IdUnivLorraine">[UL]RSJ--</idno>
          <idno type="ROR">https://ror.org/04x6jg419</idno>
          <orgName>Laboratoire de Conception, Optimisation et Modélisation des Systèmes</orgName>
          <orgName type="acronym">LCOMS</orgName>
          <date type="start">2013-01-01</date>
          <desc>
            <address>
              <addrLine>LCOMS EA7306, Université de Lorraine, Metz 57000, France</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://lcoms.univ-lorraine.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UR7306" active="#struct-413289" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-316561" status="VALID">
          <idno type="IdRef">199609713</idno>
          <idno type="ISNI">0000000100838856</idno>
          <idno type="ROR">https://ror.org/001mf9v16</idno>
          <idno type="Wikidata">Q7896681</idno>
          <orgName>University of Gezira [Wad Madani, Sudan] [University of al-Jazirah] = جامعة الجزيرة</orgName>
          <orgName type="acronym">U. of G.</orgName>
          <date type="start">1975-01-01</date>
          <desc>
            <address>
              <addrLine>Wad Madani – Soudan</addrLine>
              <country key="SD"/>
            </address>
            <ref type="url">http://uofg.edu.sd/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-325259" status="VALID">
          <idno type="ROR">https://ror.org/02jbayz55</idno>
          <orgName>University of Khartoum</orgName>
          <desc>
            <address>
              <addrLine>Al-Gamaa Ave, Al Khurtum 11111, Soudan</addrLine>
              <country key="SD"/>
            </address>
            <ref type="url">https://www.uofk.edu/index.php/ar/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-413289" status="VALID">
          <idno type="IdRef">157040569</idno>
          <idno type="IdUnivLorraine">[UL]100--</idno>
          <idno type="ROR">https://ror.org/04vfs2w97</idno>
          <orgName>Université de Lorraine</orgName>
          <orgName type="acronym">UL</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lorraine.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>