Abstract
Disassembly takes place in remanufacturing, recycling and disposal, with a flow shop 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 problem, which is proven NP-hard. Stochastic (genetic algorithm) and deterministic (greedy/hill-climbing hybrid heuristic) methods are presented and compared. Numerical results are obtained using a recent electronic product case study.
Keywords
Disassembly line balancing, Stochastic algorithm
Subject Categories
Production engineering
Disciplines
Engineering
Publisher
Omnipress
Publication Date
2005
Rights Information
Copyright 2005, Surendra M. Gupta
Rights Holder
Gupta M. Surendra
Permanent URL
Recommended Citation
Gupta, Surendra M. and McGovern, Seamus M., "Stochastic and deterministic combinatorial optimization solutions to an electronic product disassembly flow shop" (2005). . Paper 107. http://hdl.handle.net/2047/d10014056
Click button above to open, or right-click to save.
Notes
Originally published in the Proceedings of the 2005 Northeast Decision Sciences Institute Conference, Philadelphia, Pennsylvania, March 30-April 1, 2005 (CD-ROM)