Minimizing costs is easier than minimizing peaks when supplying the heat demand of a group of houses
Year of publication: |
2015
|
---|---|
Authors: | Fink, Jiří ; Hurink, Johann L. |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 242.2015, 2, p. 644-650
|
Publisher: |
Elsevier |
Subject: | Complexity | Dynamic programming | Job scheduling | Lot-sizing |
-
Minimizing costs is easier than minimizing peaks when supplying the heat demand of a group of houses
Fink, Jiří, (2015)
-
A single-item lot-sizing problem with a by-product and inventory capacities
Suzanne, Elodie, (2020)
-
A dynamic lot-sizing model with demand time windows
Lee, Chung-Yee, (1999)
- More ...
-
Minimizing costs is easier than minimizing peaks when supplying the heat demand of a group of houses
Fink, Jiří, (2015)
-
Long cycles in hypercubes with optimal number of faulty vertices
Fink, Jiří, (2012)
-
Brueggemann, Tobias, (2006)
- More ...