Formulation and Search of Assembly Sequence Design Spaces for Efficient Use of Assembly Plant Resources for New Products

Abstract

Efficient procedures for generation of feasible assembly sequences and effective utilization of available assembly plant resources can greatly reduce the development time and cost of platforms for new product family members. This article presents a method to generate feasible assembly sequences and an approach to select an assembly process that reduces the existing plant modification cost. Assembly sequence design space is combinatorial in nature. Mathematical models to solve the effects of constraints on these spaces and algorithms to efficiently enumerate feasible spaces are explored in this research. Algorithms to search the feasible space to identify assembly process that can reduce the modification cost of the existing assembly plant can help increase utilization of existing resources. A software application that implements the method and algorithms has been developed. The algorithms use the concept of recursive partitioning of set of components to generate assembly sequence space. The assembly processes are then evaluated to determine the process that maximizes resource utilization for new platforms. The application of the proposed approach is demonstrated using automotive underbody front structure family.