Feasibility study for an automated engineering change process.

Saved in:

Bibliographic Details
Title:	Feasibility study for an automated engineering change process.
Authors:	Sharp, M. E.¹ (AUTHOR), Hedberg Jr, T. D.¹ (AUTHOR) thedberg@umd.edu, Bernstein, W. Z.¹ (AUTHOR), Kwon, S.^1,2 (AUTHOR)
Source:	International Journal of Production Research. Aug2021, Vol. 59 Issue 16, p4995-5010. 16p. 3 Diagrams, 2 Charts, 3 Graphs.
Subjects:	Production engineering, Feasibility studies, Search algorithms, Genetic algorithms, Engineering mathematics
Abstract:	Engineering change is a significant cost for projects. While avoiding and mitigating the risk of change is ideal, mistakes and improvements are recognised as more is learned about the decisions made in a design. This paper presents a feasibility and performance analysis of automating engineering change requests to demonstrate the promise for increasing speed, efficiency, and effectiveness of product-lifecycle-wide engineering-change-requests. A comparatively simple case is examined to mimic the reduced set of alterable aspects of a typical change request and to highlight the need of appropriate search algorithms as brute force methods are prohibitively resource intensive. Although such cases may seem trivial for human agents, with the volume of expected change requests in a typical facility, the potential opportunity gain by eliminating or reducing the amount of human effort in low-level changes accumulate into significant returns for the industry on time and money. Herein, the genetic algorithm is selected to demonstrate feasibility with its broad scope of applicability and low barriers to deployment. Future refinement of this or other sophisticated algorithms leveraging the nature of the standard representations and qualities of alterable design features could produce tools with strong implications for process efficiency and industry competitiveness in its projects execution. [ABSTRACT FROM AUTHOR]
	Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	Engineering change is a significant cost for projects. While avoiding and mitigating the risk of change is ideal, mistakes and improvements are recognised as more is learned about the decisions made in a design. This paper presents a feasibility and performance analysis of automating engineering change requests to demonstrate the promise for increasing speed, efficiency, and effectiveness of product-lifecycle-wide engineering-change-requests. A comparatively simple case is examined to mimic the reduced set of alterable aspects of a typical change request and to highlight the need of appropriate search algorithms as brute force methods are prohibitively resource intensive. Although such cases may seem trivial for human agents, with the volume of expected change requests in a typical facility, the potential opportunity gain by eliminating or reducing the amount of human effort in low-level changes accumulate into significant returns for the industry on time and money. Herein, the genetic algorithm is selected to demonstrate feasibility with its broad scope of applicability and low barriers to deployment. Future refinement of this or other sophisticated algorithms leveraging the nature of the standard representations and qualities of alterable design features could produce tools with strong implications for process efficiency and industry competitiveness in its projects execution. [ABSTRACT FROM AUTHOR]
ISSN:	00207543
DOI:	10.1080/00207543.2021.1893900