论文标题
用于安排一组热泵的近似算法
Approximation algorithms for scheduling a group of heat pumps
论文作者
论文摘要
本文研究了一组供暖系统计划问题，这些加热系统为房屋中的家庭用途提供热水需求。这些系统（例如气体或电动锅炉，热泵或微琴）使用外部能源来加热水，并存储这种热水以提供家庭需求。后者在某种程度上允许与热量需求的热量产生。我们专注于每个加热系统都有其自身需求和缓冲区的情况，并且供暖系统的供应来自一个共同的来源。实际上，通用来源可能导致供暖系统组计划的耦合。提供能量的瓶颈可能是分配系统的能力（例如电力网络或天然气网络）。由于必须将其尺寸用于最大消耗，因此最小化最大峰很重要。该计划问题已知是\ np-hard。我们提出了四种峰最小化问题变体的多项式时间近似算法，并确定了最坏情况的近似误差。
This paper studies planning problems for a group of heating systems which supply the hot water demand for domestic use in houses. These systems (e.g. gas or electric boilers, heat pumps or microCHPs) use an external energy source to heat up water and store this hot water for supplying the domestic demands. The latter allows to some extent a decoupling of the heat production from the heat demand. We focus on the situation where each heating system has its own demand and buffer and the supply of the heating systems is coming from a common source. In practice, the common source may lead to a coupling of the planning for the group of heating systems. The bottleneck to supply the energy may be the capacity of the distribution system (e.g. the electricity networks or the gas network). As this has to be dimensioned for the maximal consumption, it is important to minimize the maximal peak. This planning problem is known to be \NP-hard. We present polynomial-time approximation algorithms for four variants of peak minimization problems, and we determine the worst-case approximation error.
