On parallel dedicated machines scheduling under energy consumption limit
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F21%3A00347906" target="_blank" >RIV/68407700:21230/21:00347906 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21730/21:00347906
Result on the web
<a href="https://doi.org/10.1016/j.cie.2021.107209" target="_blank" >https://doi.org/10.1016/j.cie.2021.107209</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.cie.2021.107209" target="_blank" >10.1016/j.cie.2021.107209</a>
Alternative languages
Result language
angličtina
Original language name
On parallel dedicated machines scheduling under energy consumption limit
Original language description
This work studies a discrete manufacturing scheduling problem faced by companies with energy-intensive processes. A scheduling environment with parallel dedicated machines is considered, where each machine consumes electric energy while processing a job. Usually, the manufacturing companies have a contract with an electric utility that specifies the peak energy demand for any fixed metering interval of a day. Violating this energy limit leads to significant penalty fees, which the manufacturing companies prefer to avoid. This paper investigates a class of scheduling problems with such energy consumption limits from theoretical and practical standpoints. First, the computational complexity of four different variants of this scheduling problem was analyzed. Second, an adaptive local search heuristic algorithm was proposed for the general problem. The experimental results show that the proposed heuristic outperforms the state-of-the-art constraint programming model and a mixed-integer linear programming model inspired by the existing literature. For the large instances with 150 and 350 jobs on each machine, the proposed heuristic finds the best solution in 71.43% of the cases, whereas the constraint programming model only in 10.32% of the cases (the mixed-integer linear programming model is not able to provide a feasible solution for these instances).
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
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/EF16_026%2F0008432" target="_blank" >EF16_026/0008432: Cluster 4.0 - Methodology of System Integration</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
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 & Industrial Engineering
ISSN
0360-8352
e-ISSN
1879-0550
Volume of the periodical
159
Issue of the periodical within the volume
September
Country of publishing house
GB - UNITED KINGDOM
Number of pages
38
Pages from-to
—
UT code for WoS article
000698643000002
EID of the result in the Scopus database
2-s2.0-85110468276