Abstract
An innovative methodology named (ASP-LMPR) for the computerized generation of assembly sequence plans (ASP) and product families using a logical liaison matrix (LM) and precedence relationships (PR) is described. The liaison matrix uses logical signs to express each assembly component's relationship status, which can analyse the combination of logic relationships, and to determine the feasible assembly plans for the product families. The ASP-LMPR is a novel method that uses Boolean operators of iterative sequencing, during each loop of the planning algorithm, to generate a set of feasible assembly plan. Using Boolean algebra rules to construct the logical combination can enhance the rapid identification of the product's organization suitability and optimal assembly sequence. The logical procedure and compact configurations of the ASP-LMPR system are easily adoptable for solution generation via systematic and computerized management. A numerical example is provided to illustrate the effectiveness of the proposed approach.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
