Graph theoretic algorithms for the ground based strategic deterrent program : prioritization and scheduling / Don Snyder [and 4 others].

Format:

Book

Author/Creator:

Snyder, Don, 1962- author.

Contributor:

Project Air Force (U.S.). Force Modernization and Employment Program.

Rand Corporation.

United States. Department of the Air Force.

Language:

English

Subjects (All):

Graph algorithms.

Intercontinental ballistic missiles--United States.

Intercontinental ballistic missiles.

Armed Forces--Procurement--Automation.

United States.

United States. Air Force--Procurement--Automation.

United States. Air Force.

Other Title:

Graph Theoretic Algorithms for the Ground Based Strategic Deterrent Program

Place of Publication:

Santa Monica, Calif. RAND Corporation 2021

Summary:

During the execution of programs, managers must orchestrate the planning and performance of upwards of tens of thousands of interdependent tasks. Many of these tasks have interdependencies such that failure to meet scheduling expectations in one task can affect the execution of many others. 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. The Ground Based Strategic Deterrent (GBSD) currently under development — a complete replacement for the aging LGM-30 Minuteman III intercontinental ballistic missile system — is a good example of a large, complex program with numerous interdependent tasks. Given the tight schedule by which GBSD is bound and the numerous organizations participating, it is necessary that the required certification process for nuclear systems proceeds in an efficient manner. In this report, the authors present the underlying rationale behind algorithms already delivered to the 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. Although the novel methods described in this report were developed for the GBSD program, they are general and can be applied to any program.

Contents:

Chapter One: Introduction

Chapter Two: Prioritization

Chapter Three: Scheduling

Chapter Four: Resource Constraints

Chapter Five: Analytic Approach for Calculating the Criticality Index

Chapter Six: Conclusions

Appendix A: Equivalence of Representations

Appendix B: The PERT and CPM Algorithms

Appendix C: Proof That Convolution of Independent, Identical Beta Distributions Converges to a Normal Distribution

Appendix D: Derivation of Maximum Order Statistic Formula.

Notes:

Description based on electronic resource