Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

External Link

Surendra M. Gupta

Disassembly line balancing

Articles 1 - 2 of 2

Full-Text Articles in Engineering

Computational Complexity Of A Reverse Manufacturing Line, Surendra Gupta, Seamus Mcgovern Sep 2010

Computational Complexity Of A Reverse Manufacturing Line, Surendra Gupta, Seamus Mcgovern

Surendra M. Gupta

Disassembly has recently gained attention in the literature due to its role in product recovery. Disassembly activities take place in various recovery operations including remanufacturing, recycling, and disposal. The disassembly line is the best choice for automated disassembly of returned products. It is therefore important that the disassembly line be designed and balanced so that it works as efficiently as possible. However, finding the optimal balance is computationally intensive with exhaustive search quickly becoming prohibitively large, even for relatively small products, due to exponential growth. In this paper, complexity theory is reviewed and used to prove that the DISASSEMBLY LINE …


Multi-Criteria Ant System And Genetic Algorithm For End-Of-Life Decision Making, Surendra Gupta, Seamus Mcgovern Sep 2010

Multi-Criteria Ant System And Genetic Algorithm For End-Of-Life Decision Making, Surendra Gupta, Seamus 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, disassembly-specific concerns. Finding the optimal balance is computationally intensive due to factorial growth. Ant colony optimization and genetic algorithm metaheuristics are presented and compared along with an exa mple to illustrate the implementation. Conclusions drawn include the consistent generation of optimal or near-optimal solutions, the ability to preserve precedence, the speed of the metaheuristics, and their practicality due to ease of …