<?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-02981199</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-14T23:49:22+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Grouping tasks to save energy in a cyclic scheduling problem: A complexity study</title>
            <author role="aut">
              <persName>
                <forename type="first">Claire</forename>
                <forename type="middle">C.</forename>
                <surname>Hanen</surname>
              </persName>
              <email type="md5">95a57a519ce5232c419303874d2e5da9</email>
              <email type="domain">parisnanterre.fr</email>
              <idno type="idhal" notation="string">claire-hanen</idno>
              <idno type="idhal" notation="numeric">11036</idno>
              <idno type="halauthorid" notation="string">3280-11036</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-2482-5042</idno>
              <idno type="IDREF">https://www.idref.fr/032602065</idno>
              <idno type="ISNI">http://isni.org/isni/000000000028530X</idno>
              <idno type="VIAF">https://viaf.org/viaf/49301186</idno>
              <affiliation ref="#struct-116205"/>
              <affiliation ref="#struct-541718"/>
              <affiliation ref="#struct-475360"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Zdenek</forename>
                <surname>Hanzalek</surname>
              </persName>
              <idno type="halauthorid">931174-0</idno>
              <affiliation ref="#struct-242783"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Claire</forename>
                <surname>HANEN</surname>
              </persName>
              <email type="md5">95a57a519ce5232c419303874d2e5da9</email>
              <email type="domain">parisnanterre.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2020-10-27 21:12:59</date>
              <date type="whenModified">2024-10-31 03:10:44</date>
              <date type="whenReleased">2020-10-28 12:19:59</date>
              <date type="whenProduced">2020</date>
              <date type="whenEndEmbargoed">2020-10-27</date>
              <ref type="file" target="https://hal.science/hal-02981199v1/document">
                <date notBefore="2020-10-27"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-02981199v1/file/grouping_revision36.pdf" id="file-2981199-2626968">
                <date notBefore="2020-10-27"/>
              </ref>
              <ref type="externalLink" target="https://hal.archives-ouvertes.fr/hal-01272444/file/grouping%21ROADEF2012_revision.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="440159">
                <persName>
                  <forename>Claire</forename>
                  <surname>HANEN</surname>
                </persName>
                <email type="md5">95a57a519ce5232c419303874d2e5da9</email>
                <email type="domain">parisnanterre.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02981199</idno>
            <idno type="halUri">https://hal.science/hal-02981199</idno>
            <idno type="halBibtex">hanen:hal-02981199</idno>
            <idno type="halRefHtml">&lt;i&gt;European Journal of Operational Research&lt;/i&gt;, 2020, 284 (2), pp.445-459. &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.ejor.2020.01.005"&gt;&amp;#x27E8;10.1016/j.ejor.2020.01.005&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">European Journal of Operational Research, 2020, 284 (2), pp.445-459. &amp;#x27E8;10.1016/j.ejor.2020.01.005&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-2981199-2626968"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-PARIS10" corresp="UNIV-PARIS-LUMIERES">Université Paris Nanterre</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</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="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SORBONNE-UNIV" corresp="SORBONNE-UNIVERSITE">Sorbonne Université 01/01/2018</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="UNIV-PARIS-LUMIERES"/>
            <idno type="stamp" n="TEST-HALCNRS">Collection test HAL CNRS</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="UNIV-PARIS-NANTERRE" corresp="UNIV-PARIS-LUMIERES">Université Paris Nanterre</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="SUPRA_MATHS_INFO">Mathématiques + Informatique</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">Grouping tasks to save energy in a cyclic scheduling problem: A complexity study</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Claire</forename>
                    <forename type="middle">C.</forename>
                    <surname>Hanen</surname>
                  </persName>
                  <email type="md5">95a57a519ce5232c419303874d2e5da9</email>
                  <email type="domain">parisnanterre.fr</email>
                  <idno type="idhal" notation="string">claire-hanen</idno>
                  <idno type="idhal" notation="numeric">11036</idno>
                  <idno type="halauthorid" notation="string">3280-11036</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-2482-5042</idno>
                  <idno type="IDREF">https://www.idref.fr/032602065</idno>
                  <idno type="ISNI">http://isni.org/isni/000000000028530X</idno>
                  <idno type="VIAF">https://viaf.org/viaf/49301186</idno>
                  <affiliation ref="#struct-116205"/>
                  <affiliation ref="#struct-541718"/>
                  <affiliation ref="#struct-475360"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Zdenek</forename>
                    <surname>Hanzalek</surname>
                  </persName>
                  <idno type="halauthorid">931174-0</idno>
                  <affiliation ref="#struct-242783"/>
                </author>
              </analytic>
              <monogr>
                <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">284</biblScope>
                  <biblScope unit="issue">2</biblScope>
                  <biblScope unit="pp">445-459</biblScope>
                  <date type="datePub">2020</date>
                  <date type="dateEpub">2020-01-24</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1016/j.ejor.2020.01.005</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">energy savings</term>
                <term xml:lang="en">task grouping</term>
                <term xml:lang="en">cyclic scheduling</term>
                <term xml:lang="en">complexity theory</term>
                <term xml:lang="en">scheduling</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 motivated by the repetitive and periodic transmission of messages in Wireless Sensor Networks (WSNs) given by the ZigBee standard. In order to save energy, communication tasks are grouped in time. The WSN applications, such as control loops used in production lines, impose deadlines on the message delivery time. By introducing a grouping constraint, this paper extends the polynomial cyclic scheduling problem of building a periodic schedule with uniform precedence constraints and no resource constraints. We consider that each task belongs to one group, and each group is to be scheduled as a super-task in every period. We show two examples issued from different applications of such grouping constraints, using uniform constraints to model the deadlines expressed in the number of periods. We tackle the feasibility problem (the existence of a periodic schedule), which has shown to be independent of the processing times. We propose a graph formulation of the problem using the retiming technique. In the ZigBee case, we prove that the particular tree structure of the groups and of the uniform precedences based upon the communication tree, lead to a polynomial algorithm to solve the problem. But the general problem is proven to be NP-complete even if no additional resource constraints are considered, and unit processing times are assumed. This extension of the cyclic scheduling leads to a new range of grouping problems with applications, not only in communication networks but also in production and logistics scheduling.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-116205" status="VALID">
          <idno type="IdRef">026403587</idno>
          <idno type="ROR">https://ror.org/013bkhk48</idno>
          <orgName>Université Paris Nanterre</orgName>
          <orgName type="acronym">UPN</orgName>
          <date type="start">1970-01-01</date>
          <desc>
            <address>
              <addrLine>200 avenue de la République - 92001 Nanterre cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.parisnanterre.fr</ref>
          </desc>
        </org>
        <org type="researchteam" xml:id="struct-541718" status="VALID">
          <orgName>Recherche Opérationnelle</orgName>
          <orgName type="acronym">RO</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-541703" type="direct"/>
            <relation active="#struct-413221" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-475360" status="VALID">
          <idno type="ROR">https://ror.org/03b4d6f26</idno>
          <orgName>Université Paris Lumières</orgName>
          <orgName type="acronym">UPL</orgName>
          <date type="start">2014</date>
          <desc>
            <address>
              <addrLine>140 rue du chevaleret 75013 PARIS</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-plum.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-242783" status="VALID">
          <orgName>Czech Technical University in Prague</orgName>
          <orgName type="acronym">CTU</orgName>
          <date type="start">1707-01-01</date>
          <desc>
            <address>
              <addrLine>České vysoké učení technické v Praze Zikova 1903/4 166 36 Praha 6 Česká republika</addrLine>
              <country key="CZ"/>
            </address>
            <ref type="url">https://www.cvut.cz/en/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-541703" status="VALID">
          <idno type="IdRef">13558292X</idno>
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>LIP6</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-413221" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-413221" status="VALID">
          <idno type="IdRef">221333754</idno>
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Sorbonne Université</orgName>
          <orgName type="acronym">SU</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>21 rue de l’École de médecine - 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sorbonne-universite.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>
      </listOrg>
    </back>
  </text>
</TEI>