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 part removal sequence. 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 algorithm and its practicality due to the ease of implementation.
Disassembly, Disassembly Line Balancing, Combinatorial Optimization, Greedy Algorithm, Hill-Climbing, Heuristics, Product Recovery
Industrial Engineering | Mechanical Engineering
(c) 2003 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
McGovern, Seamus M. and Gupta, Surendra M., "Greedy algorithm for disassembly line scheduling" (2003). Mechanical and Industrial Engineering Faculty Publications. Paper 15. http://hdl.handle.net/2047/d20000297
Click button above to open, or right-click to save.COinS