Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in 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
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 …
Uninformed And Probabilistic Distributed Agent Combinatorial Searches For The Unary Np-Complete Disassembly Line Balancing Problem, Surendra M. Gupta, Seamus M. Mcgovern
Uninformed And Probabilistic Distributed Agent Combinatorial Searches For The Unary Np-Complete Disassembly Line Balancing Problem, Surendra M. Gupta, Seamus M. Mcgovern
Surendra M. Gupta
Disassembly takes place in remanufacturing, recycling and disposal, with a line being the best choice for automation. The disassembly line balancing problem seeks a sequence which: is feasible, minimizes workstations, and ensures similar idle times, as well as other end-of-life specific concerns. Finding the optimal balance is computationally intensive due to exponential growth. Combinatorial optimization methods hold promise for providing solutions to the disassembly line balancing problem, which is proven here to belong to the class of unary NP-complete problems. Probabilistic (ant colony optimization) and uninformed (H-K) search methods are presented and compared. Numerical results are obtained using a recent …
Combinatorial Optimization Methods For Disassembly Line Balancing, Seamus M. Mcgovern, Surendra M. Gupta
Combinatorial Optimization Methods For Disassembly Line Balancing, Seamus M. Mcgovern, Surendra M. Gupta
Surendra M. Gupta
Disassembly takes place in remanufacturing, recycling, and disposal with a line being the best choice for automation. The disassembly line balancing problem seeks a sequence which: minimizes workstations, ensures similar idle times, and is feasible. Finding the optimal balance is computationally intensive due to factorial growth. Combinatorial optimization methods hold promise for providing solutions to the disassembly line balancing problem, which is proven to belong to the class of NP-complete problems. Ant colony optimization, genetic algorithm, and H-K metaheuristics are presented and compared along with a greedy/hill-climbing heuristic hybrid. A numerical study is performed to illustrate the implementation and compare …