paper-with-me

Papers

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

2019-10-11 · Ondrej Benedikt, Baran Alikoc, Premysl Sucha, Sergej Celikovsky, Zdenek Hanzalek

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.

📄 PDF Abstract BibTeX arXiv:1910.07501

Code (0)

등록된 구현이 없습니다.

Tasks

Scheduling

Similar Papers 제목 키워드 기반

RL-ASL: A Dynamic Listening Optimization for TSCH Networks Using Reinforcement Learning

2026-04-08 · F. Fernando Jurado-Lasso, J. F. Jurado arxiv

Time Slotted Channel Hopping (TSCH) is a widely adopted Media Access Control (MAC) protocol within the IEEE 802.15.4e standard, designed to provide reliable and energy-efficient communication in Industrial Internet of Th…

Reinforcement Learning

Resource-constrained Project Scheduling with Time-of-Use Energy Tariffs and Machine States: A Logic-based Benders Decomposition Approach

2026-01-10 · Corentin Juvigny, Antonín Novák, Jan Mandík, Zdeněk Hanzálek arxiv

In this paper, we investigate the Resource-Constrained Project Scheduling Problem (RCPSP) with Time-of-Use (TOU) energy tariffs and machine states, a variant of RCPSP for production scheduling, where energy price is part…

Optimal On-Off Transmission Schemes for Full Duplex Wireless Powered Communication Networks

2020-02-10

In this paper, we consider a full duplex wireless powered communication network where multiple users with radio frequency energy harvesting capability communicate to an energy broadcasting hybrid access point. We investi…

Scheduling

Robust Appointment Scheduling with Waiting Time Guarantees

2024-02-19 · Carolin Bauerhenne, Rainer Kolisch, Andreas S. Schulz

Appointment scheduling problems under uncertainty encounter a fundamental trade-off between cost minimization and customer waiting times. Most existing studies address this trade-off using a weighted sum approach, which …

Scheduling

Minimum Length Scheduling for Full Duplex Time-Critical Wireless Powered Communication Networks

2020-02-03 · Muhammad Shahid Iqbal, Yalcin Sadi, Sinem Coleri

Radio frequency (RF) energy harvesting is key in attaining perpetual lifetime for time-critical wireless powered communication networks due to full control on energy transfer, far field region, small and low-cost circuit…

Scheduling