All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

A polynomial-time scheduling approach to minimise idle energy consumption: An application to an industrial furnace

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F21%3A00536752" target="_blank" >RIV/67985556:_____/21:00536752 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21230/21:00344724 RIV/68407700:21730/21:00344724

  • Result on the web

    <a href="https://www.sciencedirect.com/science/article/pii/S0305054820302847?via%3Dihub" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0305054820302847?via%3Dihub</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.cor.2020.105167" target="_blank" >10.1016/j.cor.2020.105167</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A polynomial-time scheduling approach to minimise idle energy consumption: An application to an industrial furnace

  • Original language description

    This article presents a novel scheduling approach to minimise the energy consumption of a machine during its idle periods. In the scheduling domain, it is common to model the behaviour of the machine by defining a small set of machine modes, e.g. ‘‘on”, ‘‘off” and ‘‘stand-by”. Then the transitions between the modes are represented by a static transition graph. In this paper, we argue that this type of model might be too restrictive for some types of machines (e.g. the furnaces). For such machines, we propose to employ the complete time-domain dynamics and integrate it into an idle energy function. This way, the scheduling algorithm can exploit the full knowledge about the machine dynamics with minimised energy consumption encapsulated in this function. In this paper, we study a scheduling problem, where the tasks characterised by release times and deadlines are scheduled in the given order such that the idle energy consumption of the machine is minimised. We show that this problem can be solved in polynomial time whenever the idle energy function is concave. To highlight the practical applicability, we analyse a heat-intensive system employing a steel-hardening furnace. We derive an energy optimal control law, and the corresponding idle energy function, for the bilinear system model approximating the dynamics of the furnace (and possibly other heat-intensive systems). Further, we prove that the idle energy function is, indeed, concave in this case. Therefore, the proposed scheduling algorithm can be used. Numerical experiments show that by using our approach, combining both the optimal control and optimal scheduling, higher energy savings can be achieved, compared to the state-of-the-art scheduling approaches.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    20204 - Robotics and automatic control

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2021

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Computers & Operations Research

  • ISSN

    0305-0548

  • e-ISSN

    1873-765X

  • Volume of the periodical

    128

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    15

  • Pages from-to

    105167

  • UT code for WoS article

    000632975100001

  • EID of the result in the Scopus database

    2-s2.0-85098205812