Abstract
A disassembly line balancing problem (DLBP) aims at streamlining the disassembly activities such that the total disassembly time consumed at each workstation is approximately the same and approaching the cycle time. The assignment of disassembly operations to workstations in a disassembly line should ensure the recovery of valuable components and reduce undesirable impact on the environment as much as possible. This paper first studies a multi-criterion decision making (MCDM) for the DLBP by means of grey relational analysis (GRA) and Choquet fuzzy integral. Based on the ranking of MCDM, we develop a fast ranking heuristic approach to determine the optimum/near-optimum disassembly sequences. The proposed approach is illustrated with a real-world example and the results show its efficacy in solving the DLBP.
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.
