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 : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 242.2015, 2 (16.4.), p. 644-650
|
Subject: | Complexity | Dynamic programming | Job scheduling | Lot-sizing | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Dynamische Optimierung |
-
Evaluation of solution approaches for a stochastic lot-sizing and sequencing problem
Schemeleva, Kseniya, (2018)
-
Solving multi-agent scheduling problems on parallel machines with a global objective function
Sadi, Faiza, (2014)
-
Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences
Cheng, T. C. E., (2021)
- 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 ...