2-opt heuristic for the disassembly line balancing problem

Seamus M. McGovern; Surendra M. Gupta

doi:10.1117/12.516155

27 February 2004 2-opt heuristic for the disassembly line balancing problem

Proceedings Volume 5262, Environmentally Conscious Manufacturing III; (2004) https://doi.org/10.1117/12.516155
Event: Photonics Technologies for Robotics, Automation, and Manufacturing, 2003, Providence, RI, United States

Abstract

Disassembly activities are an important part of product recovery operations. The disassembly line is the best choice for automated disassembly of returned products. However, finding the optimal balance for a disassembly line 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 addressing hazardous and high demand components. A two optimal algorithm is then developed to balance the part removal sequence and attempt to further reduce the total number of workstations. Examples are considered to illustrate the methodology. The conclusions drawn from the study include the consistent generation of optimal or near-optimal solutions, the ability to preserve precedence, the speed of the algorithms and their practicality due to the ease of implementation.

Citation Download Citation

Seamus M. McGovern and Surendra M. Gupta "2-opt heuristic for the disassembly line balancing problem", Proc. SPIE 5262, Environmentally Conscious Manufacturing III, (27 February 2004); https://doi.org/10.1117/12.516155

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