Abstract

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.