Premium
Some Efficient Dynamic Programing Algorithms for the Optimal Sequencing and Scheduling of Water Supply Projects
Author(s) -
Morin Thomas L.,
Esogbue Augustine M. O.
Publication year - 1971
Publication title -
water resources research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.863
H-Index - 217
eISSN - 1944-7973
pISSN - 0043-1397
DOI - 10.1029/wr007i003p00479
Subject(s) - scheduling (production processes) , computer science , dynamic programming , mathematical optimization , selection (genetic algorithm) , dimension (graph theory) , dynamic priority scheduling , algorithm , schedule , mathematics , machine learning , pure mathematics , operating system
The sequencing and scheduling aspects of some important capacity expansion problems encountered in water resources development are studied. Dynamic programing algorithms are developed for both project timing problems and combined project selection and timing problems involving durable high cost water supply projects, which in the aggregate are subject to continuous time demand requirements. The structure of the problems is successfully exploited to produce computationally efficient algorithms to solve problems of the dimension encountered in water resources systems. The computational superiority of these algorithms over conventional dynamic programing algorithms is discussed and illustrated by a numerical example.