Defense and Aerospace Systems Acquisition projects, just like any other Large-Scale Complex Engineered Systems (LSCES) experience delays and cost overrun during the acquisition process. Cost overrun and delays in LSCES are due, in part, to high complexity, size of the project, involvement of various stakeholders, organizations, political disruptions, changes in requirements and scope. These uncertainties, due to the exogenous factors, have cost the federal government billions of dollars and delays in completion of the programs. Cost estimation of federal programs is usually based on previous generations of systems produced and almost all the time the costs are underestimated. Underestimation of the cost of the programs is an endogenous factor, which results in cost overrun for any program, the behavior of the cost escalation is pre-forecasted to be normally distributed, but due to the cost overrun, the cost escalation curve may be skewed. In this paper, the authors will be studying the cost escalation and time delays of the Advanced Extremely High Frequency (AEHF), a DoD’s space acquisition program. The distribution of the cost and time can aid in understanding the effects of endogenous factors influencing the cost overrun and the effect of change in requirements during the acquisition process. This data will serve as a foundation for further research to create a framework, which will be used, in better forecasting of the cost of the acquisition of the programs.
more »
« less
A Mixed-Method Analysis of Schedule and Cost Growth in Defense Acquisition Programs
Cost and schedule overruns are common in the procurement of large-scale defense acquisition programs. Current work focuses on identifying the root causes of cost growth and schedule delays in the defense acquisition programs. There is need for a mix of quantitative and qualitative analysis of cost and schedule overruns which takes into account program factor such as, technology maturity, design maturity, initial acquisition time, and program complexity. Such analysis requires an easy to access database for program-specific data about how an acquisition programs’ technical and financial characteristics vary over the time. To fulfill this need, the objective of this paper is twofold: (i) to develop a database of major US defense weapons programs which includes details of the technical and financial characteristics and how they vary over time, and (ii) to test various hypotheses about the interdependence of such characteristics using the collected data. To achieve the objective, we use a mixed-method analysis on schedule and cost growth data available in the U.S. Government Accountability Office's (GAO's) defense acquisitions annual assessments during the period 2003-2017. We extracted both analytical and textual data from original reports into Excel files and further created an easy to access database accessible from a Python environment. The analysis reveals that technology immaturity is the major driver of cost and schedule growth during the early stages of the acquisition programs while technical inefficiencies drive cost overruns and schedule delays during the later stages. Further, we find that the acquisition programs with longer initial length do not necessarily have higher greater cost growth. The dataset and the results provide a useful starting point for the research community for modeling cost and schedule overruns, and for practitioners to inform their systems acquisition processes.
more »
« less
- Award ID(s):
- 1728165
- PAR ID:
- 10282917
- Date Published:
- Journal Name:
- ASME IDETC
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Complex, multimission space exploration campaigns are particularly vulnerable to payload development and launch delays due to program-level schedule constraints and interactions between the payloads. While deterministic space logistics problems seek strongly performing (e.g., minimized cost) solutions, stochastic models must balance performance with robustness. The introduction of stochastic delays to the otherwise deterministic problem produces large and computationally intractable optimization problems. This paper presents and compares two multi-objective (minimized cost vs robustness) formulations for the stochastic campaign scheduling problem. First, a multi-objective mixed-integer quadratically constrained program (MOMIQCP) formulation is presented. Secondly, due to the computational intractability of the MOMIQCP for large problems, a method for constructing restricted, deterministic scheduling subproblems is defined. These subproblems are input to a noisy multi-objective evolutionary algorithm (NMOEA), which is used for the purpose of stochastically applying delays to the deterministic subproblem and building approximations of the objectives of the stochastic problems. Both methods are demonstrated through case studies, and the results demonstrate that the NMOEA can successfully find strongly performing solutions to larger stochastic scheduling problems.more » « less
-
Offsite construction (e.g., wood modular houses) has many advantages over traditional stick-built construction, ranging from schedule/cost reduction to improvement in safety and quality of the built product. Unlike stick-built, offsite construction demands higher levels of design and planning coordination at the early stages of the construction project to avoid cost overruns and/or delays. However, most companies still rely on 2D drawings in the development of shop drawings, which are required for the fabrication of the building components such as walls and roofs. In practice, the process of developing shop drawings is usually based on manually interpreting the 2D drawings and specifications, which is time-consuming, costly, and prone to human errors. A 3D information model can improve the accuracy of this process. To help achieve this, the authors developed a semi-automated method that can process 2D orthographic views of building components and convert them to 3D models, which can be useful for fabrication. The developed 3D information model can be further transformed to building information models (BIMs) to support collaboration amongst users and data exchanges across platforms. The developed method was evaluated in the development of wall components of a student apartment project in Kalamazoo, MI. Experimental results showed that the developed method successfully generated the 3D information model of the wall components. A time comparison with the state-of-the-art practices in developing the wall components was performed. Results showed that the developed method utilized approximately 22% of the time it took the state-of-the-art manual method to generate the 3D models.more » « less
-
In modern computing systems, jobs' resource requirements often vary over time. Accounting for this temporal variability during job scheduling is essential for meeting performance goals. However, theoretical understanding on how to schedule jobs with time-varying resource requirements is limited. Motivated by this gap, we propose a new setting of the stochastic bin-packing problem in service systems that allows for time-varying job resource requirements, also referred to as 'item sizes' in traditional bin-packing terms. In this setting, a job or 'item' must be dispatched to a server or 'bin' upon arrival. Its resource requirement may vary over time while in service, following a Markovian assumption. Once the job's service is complete, it departs from the system. Our goal is to minimize the expected number of active servers, or 'non-empty bins', in steady state. Under our problem formulation, we develop a job dispatch policy, named Join-Reqesting-Server (JRS). Broadly, JRS lets each server independently evaluate its current job configuration and decide whether to accept additional jobs, balancing the competing objectives of maximizing throughput and minimizing the risk of resource capacity overruns. The JRS dispatcher then utilizes these individual evaluations to decide which server to dispatch each arriving job to. The theoretical performance guarantee of JRS is in the asymptotic regime where the job arrival rate scales large linearly with respect to a scaling factor r. We show that JRS achieves an additive optimality gap of O(√r) in the objective value, where the optimal objective value is Θ(r). When specialized to constant job resource requirements, our result improves upon the state-of-the-art o(r) optimality gap. Our technical approach highlights a novel policy conversion framework that reduces the policy design problem into a single-server problem.more » « less
-
null (Ed.)More specialized cybersecurity education programs are needed to address workforce needs, but it is unclear which knowledge, skills, and abilities (KSAs) fulfil industry needs. We interviewed 48 professionals within four cyber defense specialty areas: (1) Cyber Network Defense Analysis, (2) Cyber Network Defense Infrastructure Support, (3) Incident Response, and (4) Vulnerability Assessment and Management. The professionals rated a number of specialized KSAs along two dimensions: how important the KSA was to their job and how difficult the KSA was to learn. Overall, communication and other non-technical skills were rated as being very important for all cyber defense jobs. Findings indicated that, for some specialty areas, technical knowledge and skills vary considerably between jobs and so the ability to teach oneself is more valuable than proficiency in any one KSA. Findings may be used to inform the development of general cybersecurity curricula, as well as curricula that focus on Cyber Network Defense Analysis, Cyber Network Defense Infrastructure Support, or Vulnerability Assessment and Management.more » « less
An official website of the United States government

