<?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-01550022</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-14T20:20:51+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Exact Solution of the Single Machine Total Tardiness Problem : the Power of Memorization</title>
            <author role="aut">
              <persName>
                <forename type="first">Lei</forename>
                <surname>Shang</surname>
              </persName>
              <email type="md5">8e751df74a50fc27ca58acd8ebee9d03</email>
              <email type="domain">univ-tours.fr</email>
              <idno type="idhal" notation="string">lei-shang</idno>
              <idno type="idhal" notation="numeric">7206</idno>
              <idno type="halauthorid" notation="string">27331-7206</idno>
              <idno type="IDREF">https://www.idref.fr/182184188</idno>
              <affiliation ref="#struct-204893"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Vincent</forename>
                <surname>T'kindt</surname>
              </persName>
              <email type="md5">bd91ec955babf6b13971d7ca6aa5b7fb</email>
              <email type="domain">univ-tours.fr</email>
              <idno type="idhal" notation="string">vincent-tkindt</idno>
              <idno type="idhal" notation="numeric">8188</idno>
              <idno type="halauthorid" notation="string">2995821-8188</idno>
              <idno type="IDREF">https://www.idref.fr/073272302</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-7440-2980</idno>
              <affiliation ref="#struct-204893"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Federico</forename>
                <surname>Della Croce</surname>
              </persName>
              <email type="md5">9e1f4932c698617cfb9520e4cf01a2bd</email>
              <email type="domain">polito.it</email>
              <idno type="idhal" notation="numeric">946989</idno>
              <idno type="halauthorid" notation="string">103386-946989</idno>
              <affiliation ref="#struct-93277"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>lei</forename>
                <surname>shang</surname>
              </persName>
              <email type="md5">8e751df74a50fc27ca58acd8ebee9d03</email>
              <email type="domain">univ-tours.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2017-06-29 11:35:26</date>
              <date type="whenModified">2025-11-04 17:34:07</date>
              <date type="whenReleased">2017-06-29 11:35:26</date>
              <date type="whenProduced">2017-10-11</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="332095">
                <persName>
                  <forename>lei</forename>
                  <surname>shang</surname>
                </persName>
                <email type="md5">8e751df74a50fc27ca58acd8ebee9d03</email>
                <email type="domain">univ-tours.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01550022</idno>
            <idno type="halUri">https://hal.science/hal-01550022</idno>
            <idno type="halBibtex">shang:hal-01550022</idno>
            <idno type="halRefHtml">&lt;i&gt;International Conference on Industral Engineering and System Management (IESM’17)&lt;/i&gt;, Oct 2017, Saarbrucken, Germany</idno>
            <idno type="halRef">International Conference on Industral Engineering and System Management (IESM’17), Oct 2017, Saarbrucken, Germany</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-TOURS">Université François Rabelais</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="ROOT-TOURS" corresp="LIFAT">Équipe Recherche Opérationnelle, Ordonnancement et Transport du Laboratoire d’Informatique de l’Université de Tours</idno>
            <idno type="stamp" n="LIFAT">Laboratoire d'Informatique Fondamentale et Appliquée de Tours</idno>
            <idno type="stamp" n="INSA-GROUPE">Groupe INSA</idno>
            <idno type="stamp" n="INSA-CVL">INSA CENTRE VAL DE LOIRE</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">Exact Solution of the Single Machine Total Tardiness Problem : the Power of Memorization</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Lei</forename>
                    <surname>Shang</surname>
                  </persName>
                  <email type="md5">8e751df74a50fc27ca58acd8ebee9d03</email>
                  <email type="domain">univ-tours.fr</email>
                  <idno type="idhal" notation="string">lei-shang</idno>
                  <idno type="idhal" notation="numeric">7206</idno>
                  <idno type="halauthorid" notation="string">27331-7206</idno>
                  <idno type="IDREF">https://www.idref.fr/182184188</idno>
                  <affiliation ref="#struct-204893"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Vincent</forename>
                    <surname>T'kindt</surname>
                  </persName>
                  <email type="md5">bd91ec955babf6b13971d7ca6aa5b7fb</email>
                  <email type="domain">univ-tours.fr</email>
                  <idno type="idhal" notation="string">vincent-tkindt</idno>
                  <idno type="idhal" notation="numeric">8188</idno>
                  <idno type="halauthorid" notation="string">2995821-8188</idno>
                  <idno type="IDREF">https://www.idref.fr/073272302</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-7440-2980</idno>
                  <affiliation ref="#struct-204893"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Federico</forename>
                    <surname>Della Croce</surname>
                  </persName>
                  <email type="md5">9e1f4932c698617cfb9520e4cf01a2bd</email>
                  <email type="domain">polito.it</email>
                  <idno type="idhal" notation="numeric">946989</idno>
                  <idno type="halauthorid" notation="string">103386-946989</idno>
                  <affiliation ref="#struct-93277"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>International Conference on Industral Engineering and System Management (IESM’17)</title>
                  <date type="start">2017-10-11</date>
                  <settlement>Saarbrucken</settlement>
                  <country key="DE">Germany</country>
                </meeting>
                <imprint/>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en"> algorithmic paradox</term>
                <term xml:lang="en"> memorization</term>
                <term xml:lang="en"> single machine total tardiness</term>
                <term xml:lang="en">exact algorithms</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-cc">Computer Science [cs]/Computational Complexity [cs.CC]</classCode>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</classCode>
              <classCode scheme="halDomain" n="math.math-oc">Mathematics [math]/Optimization and Control [math.OC]</classCode>
              <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>This paper provides new experimental results on the exact solution of the single machine total tardiness problem (SMTT). The currently fastest algorithm reported in the literature is due to Szwarc et al \cite{szwarc2001}, which solves instances with up to 500 jobs in size. The key elements of their algorithm are the use of \techmemo{} and the exploitation of an ``Algorithmic Paradox''. Recently, we revisited the problem and proposed a \techbm{} algorithm that runs in $\ostar{(2+\epsilon)^n}$ in time, with $\epsilon$ arbitrarily small, and in polynomial space. During the study of the computational performance of this algorithm, the authors occasionally found that the \techmemo{} technique used in \cite{szwarc2001} can be further boosted and their ``Paradox'' can be enhanced. The resulting algorithm is able to solve all instances with up to 1200 jobs in size. We also discuss the worst-case running time of the algorithm.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-204893" status="VALID">
          <idno type="IdRef">081090722</idno>
          <idno type="RNSR">201220254T</idno>
          <idno type="ROR">https://ror.org/03r938j26</idno>
          <orgName>Laboratoire d'Informatique Fondamentale et Appliquée de Tours</orgName>
          <orgName type="acronym">LIFAT</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>64, Avenue Jean Portalis, 37200 Tours</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://lifat.univ-tours.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UR6300" active="#struct-300298" type="direct"/>
            <relation active="#struct-303079" type="direct"/>
            <relation active="#struct-301232" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-93277" status="VALID">
          <orgName>Department of Computer Engineering</orgName>
          <orgName type="acronym">DAUIN</orgName>
          <desc>
            <address>
              <addrLine>Dipartimento di Automatica e Informatica Politecnico di Torino - Corso Duca degli Abruzzi, 24 - 10129 Torino, ITALY</addrLine>
              <country key="IT"/>
            </address>
            <ref type="url">http://www.polito.it/ricerca/dipartimenti/distr/presentazione.en.html</ref>
          </desc>
          <listRelation>
            <relation active="#struct-6571" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300298" status="VALID">
          <idno type="IdRef">026404478</idno>
          <idno type="ISNI">0000000121608742</idno>
          <idno type="ROR">https://ror.org/02wwzvj46</idno>
          <orgName>Université de Tours</orgName>
          <orgName type="acronym">UT</orgName>
          <date type="start">1970-12-17</date>
          <desc>
            <address>
              <addrLine>60 rue du Plat d'Étain, 37020 Tours cedex 1</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-tours.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-303079" status="VALID">
          <idno type="IdRef">203592077</idno>
          <orgName>Institut National des Sciences Appliquées - Centre Val de Loire</orgName>
          <orgName type="acronym">INSA CVL</orgName>
          <date type="start">2014-01-01</date>
          <desc>
            <address>
              <addrLine>88 boulevard Lahitolle, CS 60013, 18022 Bourges cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.insa-centrevaldeloire.fr/fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301232" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-301232" status="VALID">
          <idno type="IdRef">162105150</idno>
          <orgName>Institut National des Sciences Appliquées</orgName>
          <orgName type="acronym">INSA</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-6571" status="VALID">
          <idno type="IdRef">034390626</idno>
          <idno type="ISNI">0000000419370343</idno>
          <idno type="ROR">https://ror.org/00bgk9508</idno>
          <orgName>Politecnico di Torino = Polytechnic of Turin</orgName>
          <orgName type="acronym">Polito</orgName>
          <date type="start">1859-01-01</date>
          <desc>
            <address>
              <addrLine>Politecnico di Torino - Corso Duca degli Abruzzi, 24 10129 Torino</addrLine>
              <country key="IT"/>
            </address>
            <ref type="url">http://www.polito.it/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>