Algorithms for robust production scheduling with energy consumption limits

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00315039" target="_blank" >RIV/68407700:21230/17:00315039 - isvavai.cz</a>

Alternative codes found

RIV/68407700:21730/17:00315039

Result on the web

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

DOI - Digital Object Identifier

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

Result language

angličtina

Original language name

Algorithms for robust production scheduling with energy consumption limits

Original language description

In this work, we consider a scheduling problem faced by production companies with large electricity consumption. Due to the contract with the electric utility, the production companies are obligated to comply with the total energy consumption limits in the specified time intervals (usually 15-min long); otherwise, the companies pay substantial penalty fees. Although it is possible to design production schedules that consider these limits as hard constraints, uncertainties occurring during the execution of the schedules are usually not taken into account. This may lead to situations in which the unexpected delays of the operations cause the violations of the energy consumption limits. Our goal is to design robust production schedules pro-actively guaranteeing that the energy consumption limits are not violated for the given set of uncertainty scenarios. We consider scheduling on one machine with release times of the operations and total tardiness as the objective function. To tackle this problem, we first propose a pseudo-polynomial algorithm for finding the optimal robust schedule for the given permutation of the operations. This algorithm is then utilised in three different algorithms for finding the optimal permutation: two exact (Branch-and-Bound and logic-based Benders decomposition) and one heuristic algorithm (tabu search). All the algorithms were experimentally evaluated on random instances with different sizes of the uncertainty scenarios set. Using the tabu search algorithm, we are able to solve large instances within one minute.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

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

Project

<a href="/en/project/TE01020197" target="_blank" >TE01020197: Centre for Applied Cybernetics 3</a><br>

Continuities

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

Publication year

2017

Confidentiality

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

Name of the periodical

Computers & Industrial Engineering

ISSN

0360-8352

e-ISSN

1879-0550

Volume of the periodical

112

Issue of the periodical within the volume

October

Country of publishing house

GB - UNITED KINGDOM

Number of pages

18

Pages from-to

391-408

UT code for WoS article

000413126700031

EID of the result in the Scopus database

2-s2.0-85028836543