Journal article
Power generator scheduling by dynamic programming
European journal of operational research, v 1(3)
1977
Abstract
Dynamic programming is applied to the problem of determining an optimal short-run schedule for a series of power generating units to meet a time varying system load. Typical scheduling procedures include a priority ordering constraint which requires that units be committed to or removed from power production in a fixed order. A dynamic programming model which relaxes this constraints yields a large combinatorial problem whose state space depends on the number of feasible combinations of generating units. Reduction of storage requirements is achieved through the implementation of data structure techniques. An example of the dynamic programming procedure with data from an actual system suggests significant coast reductions. A comparison with a case in the literature also results in significant savings. Perhaps more important, however, are the substantial energy savings, in light of the current emphasis on energy conservation.
Metrics
2 Record Views
3 citations in Scopus
Details
- Title
- Power generator scheduling by dynamic programming
- Creators
- John Powell - University of South DakotaJohn Gleason - University of Nebraska at OmahaJon Burton - Drexel UniversityJacob R Powell - Chemistry
- Publication Details
- European journal of operational research, v 1(3)
- Publisher
- Elsevier
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Chemistry
- Scopus ID
- 2-s2.0-0017494992
- Other Identifier
- 991019173756404721