Optimal Assembly Sequence generation through computational approach
| Autor: | S. S. V. Prasad Varupala, Dileep Kumar Palavalasa, M. V. A. Raju Bahubalendruni, Anil Kumar Gulivindala |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
0209 industrial biotechnology
Sequence Mathematical optimization Multidisciplinary Computer science business.industry Software as a service Stability (learning theory) Scale (descriptive set theory) 02 engineering and technology Set (abstract data type) 020901 industrial engineering & automation Product (mathematics) 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Hardware_CONTROLSTRUCTURESANDMICROPROGRAMMING business Coherence (physics) |
| Zdroj: | Sādhanā. 44 |
| ISSN: | 0973-7677 0256-2499 |
| DOI: | 10.1007/s12046-019-1157-2 |
| Popis: | Optimal assembly sequence (OAS) is always an interesting aspect for an industrial engineer to minimize assembly time and cost, which gives number of assembly levels and sequence of assembly operations. An assembly sequence with more number of parallel possible stable sub-assemblies significantly reduces the overall assembly time for large scale products. Finding such optimal sequences from huge set of all assembly sequences (SAAS) is challenging due to involvement of multiple assembly feasibility validation criteria namely; assembly coherence, geometric feasibility, part stability and mechanical feasibility. In this paper, an efficient computational method is proposed to generate optimal assembly sequences. The method considers extended assembly stability relations to identify stable sub-assemblies for parallel execution. The method is proven in generating optimal solutions for any given product effectively. The method is well discussed and compared with prominent computational methods with suitable product illustrations. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink