Greedy algorithm for local heating problem

Jiří Fink*, Johann L. Hurink

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

14 Downloads (Pure)


This paper studies a planning problem for heating water. Hereby, boilers (e.g. gas or electric boilers, heat pumps or microCHPs) are used to heat the water and store it for domestic demands. We consider a simple boiler which is either turned on or turned off and has a buffer of limited capacity. The energy needed to run the boiler has to be bought on a day-ahead market, so we are interested in a planning which minimizes the cost to supply the boiler with energy. We present a greedy algorithm whose time complexity is O(Tα(T)) where T is the number of time intervals and α is the inverse of Ackermann function.

Original languageEnglish
Article number100627
JournalDiscrete optimization
Publication statusPublished - 5 Feb 2021


  • Greedy algorithm
  • Smart grids
  • Union-find data structure
  • UT-Hybrid-D


Dive into the research topics of 'Greedy algorithm for local heating problem'. Together they form a unique fingerprint.

Cite this