Answers are grounded in this paper and cite their sources.
A new approach is presented for solving the unit commitment problem based on branch-and-bound techniques. The method incorporates time-dependent start-up costs, demand and reserve constraints and minimum up and down time constraints. It does not require a priority ordering of the units. The method can be extended to allow for a probabilistic reserve constraint. Preliminary computational results are reported.
No takes yet. Share an insight, caveat, or question.
Cohen et al. (1983) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: