Graph Theoretic Algorithms for the Ground Based Strategic Deterrent Program: Prioritization and Scheduling
Abstract
As programs grow larger and the interdependencies of the program activities get complex, tools are needed to introduce more rigor into program management to reduce schedule risk. In this report, we present the underlying rationale behind algorithms already delivered to the Ground Based Strategic Deterrent (GBSD) program office that were designed to reduce the likelihood of rework in program execution, provide better insight into schedule risk, and provide insights into how to restructure task dependencies to manage schedule risk. The algorithms help project managers consider "what if" scenarios and visualize potential pitfalls as a project progresses. Project managers can also use these algorithms to perform sensitivity analyses on individual activities to understand which activities have the greatest potential to derail a project. Although these algorithms were developed for the GBSD program office, specifically for the Toolbox for the Unified Certification Strategy Dashboard, the methods are general and applicable to any program.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 2021
- Accession Number
- AD1152917
Entities
People
- Bart E. Bennett
- Christian Johnson
- Don A. Snyder
- Lance Menthe
- Parousia Rockstroh
Organizations
- RAND Corporation