Abstract

In chapter 6 we have seen that the problem of minimizing the (expected) cost of a project described by a GERT network can be reduced to a stochastic dynamic programming problem. That approach, however, generally requires a great computational effort. In addition, it is only applicable if the GERT network represents an admissible EOR network (which includes the stipulation that the independence and Markov properties from assumptions A2b and A2d are satisfied).

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.