Open Access. Powered by Scholars. Published by Universities.®
- Publication
Articles 1 - 3 of 3
Full-Text Articles in Mechanical Engineering
Greedy Algorithm For Disassembly Line Scheduling, Seamus M. Mcgovern, Surendra M. Gupta
Greedy Algorithm For Disassembly Line Scheduling, Seamus M. Mcgovern, Surendra M. Gupta
Seamus McGovern
Remanufacturing, recycling, and disposal recovery operations require the performance of disassembly activities. The disassembly line is the best choice for automated disassembly of returned products, however, finding the optimal balance is computationally intensive with exhaustive search quickly becoming prohibitively large. In this paper, a greedy algorithm is presented for obtaining optimal or near-optimal solutions to the disassembly line balancing problem. The greedy algorithm is a first-fit decreasing algorithm further enhanced to preserve precedence relationships. The algorithm seeks to minimize the number of workstations while accounting for hazardous and high demand components. A hill-climbing heuristic is then developed to balance the …
Greedy Algorithm For Disassembly Line Scheduling, Seamus M. Mcgovern, Surendra M. Gupta
Greedy Algorithm For Disassembly Line Scheduling, Seamus M. Mcgovern, Surendra M. Gupta
Surendra M. Gupta
Remanufacturing, recycling, and disposal recovery operations require the performance of disassembly activities. The disassembly line is the best choice for automated disassembly of returned products, however, finding the optimal balance is computationally intensive with exhaustive search quickly becoming prohibitively large. In this paper, a greedy algorithm is presented for obtaining optimal or near-optimal solutions to the disassembly line balancing problem. The greedy algorithm is a first-fit decreasing algorithm further enhanced to preserve precedence relationships. The algorithm seeks to minimize the number of workstations while accounting for hazardous and high demand components. A hill-climbing heuristic is then developed to balance the …
A Genetic Algorithm Approach To End-Of-Life Disassembly Sequencing For Robotic Disassembly, Ahmed Elsayed, Elif Kongar, Surendra M. Gupta
A Genetic Algorithm Approach To End-Of-Life Disassembly Sequencing For Robotic Disassembly, Ahmed Elsayed, Elif Kongar, Surendra M. Gupta
Surendra M. Gupta
End-of-life (EOL) processing options include reuse, remanufacturing, recycling and proper disposal. In almost all cases, a certain level of disassembly may be required due to possible changes in the original product structure. Thus, finding an optimal or near optimal disassembly sequence is crucial to increasing the efficiency of the process. Disassembly operations are labor intensive, can be costly, have unique characteristics and cannot be considered as reverse of assembly operations. Since the complexity of determining the best disassembly sequence increases as the number of parts of the product grow, an efficient methodology is reuired for disassembly sequencing. In this paper, …