Answers are grounded in this paper and cite their sources.
A fast production scheduling algorithm suitable for generation expansion studies is described in this paper. It can handle several independent rivers, thermal plants, pumped storage plants, import, export, and internal non-firm markets. Inflows and load are deterministic and a one-reservoir limit is imposed on each river. The scheduling problem is formulated as a generalized network problem which is efficiently solved by an adaption of the simplex method. The algorithm is part of a program developed by Hydro-Québec to conduct preliminary evaluations of alternative expansion plans. The program and the scheduling algorithm are presented.
No takes yet. Share an insight, caveat, or question.
Côté et al. (1987) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: