Scheduling on dedicated machines with energy consumption limit

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F19%3A00332665" target="_blank" >RIV/68407700:21230/19:00332665 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/68407700:21730/19:00332665

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Scheduling on dedicated machines with energy consumption limit

Popis výsledku v původním jazyce

This work studies a problem of scheduling non-preemptive independent jobs on dedicated machines while considering an energy consumption limit. The problem is motivated by energy-demanding production processes, such as glass tempering and steel hardening, in which a material is heated to high temperature in furnaces. The production companies have contracts with electric utilities that specify a maximum energy consumption limit. If the heating in the furnaces is not planned carefully, the energy spikes overshoot the energy consumption limit, and the companies must pay large penalty fees. In this paper, we propose two exact methods that find schedules with the minimum makespan such that the energy limit is satisfied. The first proposed method is a Constraint Programming model and the second one finds the optimal solution by iteratively re-solving aMixed Integer Linear Programming model with a decreasing scheduling horizon. The iterative algorithm exploits the fact that the start times do not need to be modeled explicitly, which leads to an efficient method for solving instances with a higher number of shorter jobs. The experimental results show that our methods outperform an adapted approach from the literature for a related problem.

Název v anglickém jazyce

Scheduling on dedicated machines with energy consumption limit

Popis výsledku anglicky

This work studies a problem of scheduling non-preemptive independent jobs on dedicated machines while considering an energy consumption limit. The problem is motivated by energy-demanding production processes, such as glass tempering and steel hardening, in which a material is heated to high temperature in furnaces. The production companies have contracts with electric utilities that specify a maximum energy consumption limit. If the heating in the furnaces is not planned carefully, the energy spikes overshoot the energy consumption limit, and the companies must pay large penalty fees. In this paper, we propose two exact methods that find schedules with the minimum makespan such that the energy limit is satisfied. The first proposed method is a Constraint Programming model and the second one finds the optimal solution by iteratively re-solving aMixed Integer Linear Programming model with a decreasing scheduling horizon. The iterative algorithm exploits the fact that the start times do not need to be modeled explicitly, which leads to an efficient method for solving instances with a higher number of shorter jobs. The experimental results show that our methods outperform an adapted approach from the literature for a related problem.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/TE01020197" target="_blank" >TE01020197: Centrum aplikované kybernetiky 3</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2019

Kód důvěrnosti údajů

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

Název statě ve sborníku

Proceedings of the 8th International Conference on Operations Research and Enterprise Systems

ISBN

978-989-758-352-0

ISSN

—

e-ISSN

—

Počet stran výsledku

10

Strana od-do

53-62

Název nakladatele

SciTePress

Místo vydání

Madeira

Místo konání akce

Prague

Datum konání akce

19. 2. 2019

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—