<?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-03091377</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-15T17:32:01+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Minimizing the total weighted flow-time of jobs with set-up times and unequal release dates: Application to minimizing maintenance operations cost</title>
            <author role="aut">
              <persName>
                <forename type="first">Kossi Pélopé</forename>
                <surname>Adzakpa</surname>
              </persName>
              <email type="md5">0293394ce2b3ac400b4260ef90d35d60</email>
              <email type="domain">utt.fr</email>
              <idno type="idhal" notation="numeric">1085370</idno>
              <idno type="halauthorid" notation="string">3044182-1085370</idno>
              <idno type="IDREF">https://www.idref.fr/130482900</idno>
              <affiliation ref="#struct-397050"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Kondo Hloindo</forename>
                <surname>Adjallah</surname>
              </persName>
              <email type="md5">45b6fdb4f434bf803aad88eb1bb703d1</email>
              <email type="domain">univ-lorraine.fr</email>
              <idno type="idhal" notation="string">kondo-h-adjallah</idno>
              <idno type="idhal" notation="numeric">739229</idno>
              <idno type="halauthorid" notation="string">28788-739229</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/D-6945-2016</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-7902-7991</idno>
              <idno type="IDREF">https://www.idref.fr/060234849</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/D-6945-2016</idno>
              <affiliation ref="#struct-397050"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Kondo Hloindo</forename>
                <surname>Adjallah</surname>
              </persName>
              <email type="md5">45b6fdb4f434bf803aad88eb1bb703d1</email>
              <email type="domain">univ-lorraine.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2020-12-30 23:29:11</date>
              <date type="whenWritten">2003</date>
              <date type="whenModified">2025-08-12 19:58:15</date>
              <date type="whenReleased">2020-12-30 23:29:11</date>
              <date type="whenProduced">2003-10-30</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="529337">
                <persName>
                  <forename>Kondo Hloindo</forename>
                  <surname>Adjallah</surname>
                </persName>
                <email type="md5">45b6fdb4f434bf803aad88eb1bb703d1</email>
                <email type="domain">univ-lorraine.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03091377</idno>
            <idno type="halUri">https://hal.univ-lorraine.fr/hal-03091377</idno>
            <idno type="halBibtex">adzakpa:hal-03091377</idno>
            <idno type="halRefHtml">&lt;i&gt;IMS'2003 - International Conference on Intelligent Maintenance Systems&lt;/i&gt;, Oct 2003, Xi’an, Shaanxi, China. pp.787-797</idno>
            <idno type="halRef">IMS'2003 - International Conference on Intelligent Maintenance Systems, Oct 2003, Xi’an, Shaanxi, China. pp.787-797</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-TROYES">Université de Technologie de Troyes</idno>
            <idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</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="UTT">UTT</idno>
            <idno type="stamp" n="LOSI" corresp="UTT">LOSI</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">Minimizing the total weighted flow-time of jobs with set-up times and unequal release dates: Application to minimizing maintenance operations cost</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Kossi Pélopé</forename>
                    <surname>Adzakpa</surname>
                  </persName>
                  <email type="md5">0293394ce2b3ac400b4260ef90d35d60</email>
                  <email type="domain">utt.fr</email>
                  <idno type="idhal" notation="numeric">1085370</idno>
                  <idno type="halauthorid" notation="string">3044182-1085370</idno>
                  <idno type="IDREF">https://www.idref.fr/130482900</idno>
                  <affiliation ref="#struct-397050"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Kondo Hloindo</forename>
                    <surname>Adjallah</surname>
                  </persName>
                  <email type="md5">45b6fdb4f434bf803aad88eb1bb703d1</email>
                  <email type="domain">univ-lorraine.fr</email>
                  <idno type="idhal" notation="string">kondo-h-adjallah</idno>
                  <idno type="idhal" notation="numeric">739229</idno>
                  <idno type="halauthorid" notation="string">28788-739229</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/D-6945-2016</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-7902-7991</idno>
                  <idno type="IDREF">https://www.idref.fr/060234849</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/D-6945-2016</idno>
                  <affiliation ref="#struct-397050"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Proceedings of the International Conference on Intelligent Maintenance Systems -  IMS'2003</title>
                <meeting>
                  <title>IMS'2003 - International Conference on Intelligent Maintenance Systems</title>
                  <date type="start">2003-10-30</date>
                  <date type="end">2003-11-01</date>
                  <settlement>Xi’an, Shaanxi</settlement>
                  <country key="CN">China</country>
                </meeting>
                <imprint>
                  <biblScope unit="serie">Proceedings of the International Conference on Intelligent Maintenance Systems - IMS'2003</biblScope>
                  <biblScope unit="volume">ISBN: 7-81099-014-4</biblScope>
                  <biblScope unit="pp">787-797</biblScope>
                  <date type="datePub">2003</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Maintenance</term>
                <term xml:lang="en">Availability</term>
                <term xml:lang="en">Release date</term>
                <term xml:lang="en">Tardiness</term>
                <term xml:lang="en">Flow-time</term>
                <term xml:lang="en">Task scheduling</term>
                <term xml:lang="en">Processor</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</classCode>
              <classCode scheme="halDomain" n="info.info-pf">Computer Science [cs]/Performance [cs.PF]</classCode>
              <classCode scheme="halDomain" n="info.info-sy">Computer Science [cs]/Systems and Control [cs.SY]</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 proposes three important and suitable results relating to the minimization of the sum of the flow-time and the tardiness of tasks or jobs with unequal release dates. The first result is a locally optimal priority rule (FTR), proposed for minimizing the sum or the linear combination of the task’s flow-time and tardiness. The second result is a scheduling algorithm based on these rules. The algorithm has a complexity of O(n3) when applied to schedule a set of n tasks on one processor. To evaluate its performance, we compare its results to a lower bound that we provide as the third result in a numerical case study. Using this algorithm combined with the tasks urgency criterion enabled us to develop an online algorithm for scheduling the tasks on q parallel processors. This latter algorithm corresponds to the fourth result that we applied for scheduling and assigning preventive maintenance tasks to processors in a distributed system. As shown in the appropriate numerical example, its efficiency minimizes the cost of preventive maintenance tasks, expressed as the sum of the tasks' tardiness and flow-time.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-397050" status="OLD">
          <orgName>Laboratoire d'Optimisation des Systèmes Industriels</orgName>
          <orgName type="acronym">LOSI</orgName>
          <date type="start">1996-01-01</date>
          <date type="end">2020-12-31</date>
          <desc>
            <address>
              <addrLine>12 rue Marie Curie, F-10010 Troyes</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://losi.utt.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-116261" type="direct"/>
            <relation active="#struct-93484" type="indirect"/>
            <relation name="UMR6281" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-116261" status="OLD">
          <idno type="RNSR">201019052V</idno>
          <orgName>Institut Charles Delaunay</orgName>
          <orgName type="acronym">ICD</orgName>
          <date type="start">2006-01-01</date>
          <date type="end">2020-12-31</date>
          <desc>
            <address>
              <addrLine>12, rue Marie Curie BP 2060 - 10010 Troyes Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://icd.utt.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93484" type="direct"/>
            <relation name="UMR6281" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93484" status="VALID">
          <idno type="ROR">https://ror.org/01qhqcj41</idno>
          <orgName>Université de Technologie de Troyes</orgName>
          <orgName type="acronym">UTT</orgName>
          <desc>
            <address>
              <addrLine>12 rue Marie CurieCS 4206010004 TROYES CEDEX</addrLine>
              <country key="FR"/>
            </address>
          </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>
      </listOrg>
    </back>
  </text>
</TEI>