On the microCHP scheduling problem

被引：5

作者：

Bosman, M. G. C. ^{[1
]}

Bakker, V. ^{[1
]}

Molderink, A. ^{[1
]}

Hurink, J. L. ^{[1
]}

Smit, G. J. M. ^{[1
]}

机构：

[1] Univ Twente, Dept Elect Engn Math & Comp Sci, NL-7500 AE Enschede, Netherlands

来源：

POWER CONTROL AND OPTIMIZATION | 2010年 / 1239卷

关键词：

scheduling; complexity; microgeneration;

D O I：

10.1063/1.3459774

中图分类号：

O59 [应用物理学];

学科分类号：

摘要：

In this paper both continuous and discrete models for the microCHP (Combined Heat and Power) scheduling problem are derived. This problem consists of the decision making to plan runs for a specific type of distributed electricity generators, the microCHP. As a special result, one model variant of the problem, named n-DSHSP-restricted, is proven to be NP-complete in the strong sense. This shows the necessity of the development of heuristics for the scheduling of microCHPs, in case multiple generators are combined in a so-called fleet.

引用

页码：367 / 374

页数：8