Combinatorial optimization methods for disassembly line balancing

Seamus M. McGovern; Surendra M. Gupta

doi:10.1117/12.570493

8 December 2004 Combinatorial optimization methods for disassembly line balancing

Proceedings Volume 5583, Environmentally Conscious Manufacturing IV; (2004) https://doi.org/10.1117/12.570493
Event: Optics East, 2004, Philadelphia, Pennsylvania, United States

Abstract

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 performance. Conclusions drawn include the consistent generation of optimal or near-optimal solutions, the ability to preserve precedence, the speed of the techniques, and their practicality due to ease of implementation.

Citation Download Citation

Seamus M. McGovern and Surendra M. Gupta "Combinatorial optimization methods for disassembly line balancing", Proc. SPIE 5583, Environmentally Conscious Manufacturing IV, (8 December 2004); https://doi.org/10.1117/12.570493

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available