bibtype J - Journal Article
ARLID 0536752
utime 20240111141046.6
mtime 20201229235959.9
WOS 000632975100001
SCOPUS 85098205812
DOI 10.1016/j.cor.2020.105167
title (primary) (eng) A polynomial-time scheduling approach to minimise idle energy consumption: An application to an industrial furnace
specification
page_count 15 s.
media_type P
serial
ARLID cav_un_epca*0252564
ISSN 0305-0548
title Computers & Operations Research
volume_id 128
publisher
name Elsevier
keyword Scheduling
keyword Energy optimisation
keyword Operational research
keyword Optimal control
keyword Electric furnaces
author (primary)
ARLID cav_un_auth*0401595
name1 Benedikt
name2 O.
country CZ
garant A
author
ARLID cav_un_auth*0401596
name1 Alikoç
name2 B.
country CZ
author
ARLID cav_un_auth*0202761
name1 Šůcha
name2 P.
country CZ
author
ARLID cav_un_auth*0101074
name1 Čelikovský
name2 Sergej
institution UTIA-B
full_dept (cz) Teorie řízení
full_dept Department of Control Theory
department (cz)
department TR
full_dept Department of Control Theory
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
author
ARLID cav_un_auth*0202762
name1 Hanzálek
name2 Z.
country CZ
source
source_type příspěvek do časopisu
url https://www.sciencedirect.com/science/article/pii/S0305054820302847?via%3Dihub
source_size 919,28
cas_special
abstract (eng) 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.
result_subspec WOS
RIV BC
FORD0 20000
FORD1 20200
FORD2 20204
reportyear 2022
num_of_auth 5
mrcbC52 4 A sml 4as 20231122145417.9
inst_support RVO:67985556
permalink http://hdl.handle.net/11104/0314742
mrcbC61 1
cooperation
ARLID cav_un_auth*0333503
name Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague
institution CIIRC, CTU in Prague
country CZ
cooperation
ARLID cav_un_auth*0401597
name Faculty of Electrical Engineering, Czech Technical University in Prague
institution FEE, CTU in Prague
country CZ
confidential S
contract
name Copyright
date 20200409
article_num 105167
mrcbC86 3+4 Article Computer Science Interdisciplinary Applications|Engineering Industrial|Operations Research Management Science
mrcbC91 C
mrcbT16-e COMPUTERSCIENCEINTERDISCIPLINARYAPPLICATIONS|ENGINEERINGINDUSTRIAL|OPERATIONSRESEARCHMANAGEMENTSCIENCE
mrcbT16-j 1.104
mrcbT16-s 1.855
mrcbT16-D Q2
mrcbT16-E Q1
arlyear 2021
mrcbTft \nSoubory v repozitáři: celikovsky-0536752-copyright.pdf
mrcbU14 85098205812 SCOPUS
mrcbU24 PUBMED
mrcbU34 000632975100001 WOS
mrcbU56 příspěvek do časopisu 919,28
mrcbU63 cav_un_epca*0252564 Computers & Operations Research 0305-0548 1873-765X Roč. 128 č. 1 2021 Elsevier