Muutke küpsiste eelistusi

Graph Theoretic Algorithms for the Ground Based Strategic Deterrent Program: Prioritization and Scheduling [Pehme köide]

  • Formaat: Paperback / softback, 80 pages, Illustrations
  • Ilmumisaeg: 15-Jan-2022
  • Kirjastus: RAND
  • ISBN-10: 1977408028
  • ISBN-13: 9781977408020
  • Formaat: Paperback / softback, 80 pages, Illustrations
  • Ilmumisaeg: 15-Jan-2022
  • Kirjastus: RAND
  • ISBN-10: 1977408028
  • ISBN-13: 9781977408020

The Ground Based Strategic Deterrent program is large and complex and has many interdependent tasks that must proceed efficiently. The authors of this report present novel methods to help program managers avoid rework and reduce schedule risk.

About This Report iii
Figures and Tables
v
Summary vii
Acknowledgments x
Abbreviations xi
1 Introduction
1(6)
Background
1(1)
Structure of This Report
2(1)
Basic Concepts
3(4)
2 Prioritization
7(5)
Reach
7(1)
Topological Ordering
8(2)
Error Checking
10(2)
3 Scheduling
12(13)
Origins of Project Management Algorithms
12(1)
Estimating Times
13(3)
The Critical Path
16(2)
Topological Considerations
18(7)
4 Resource Constraints
25(7)
Fixed Resource Requirements
25(2)
Slack
27(1)
Variable Resource Requirements
28(4)
5 Analytic Approach for Calculating the Criticality Index
32(15)
Approach
33(1)
Formalism and Notation
34(1)
Criticality Index
35(3)
Numerical Methods for Calculating the Critical Path
38(9)
6 Conclusions
47(3)
Novel Topological Insights
47(1)
Novel Numerical Methods
48(1)
Resource Constraints and Future Analysis
48(2)
Appendix A Equivalence of Representations 50(3)
Appendix B The PERT and CPM Algorithms 53(8)
Appendix C Proof That Convolution of Independent, Identical Beta Distributions Converges to a Normal Distribution 61(4)
Appendix D Derivation of Maximum Order Statistic Formula 65(1)
References 66