Deterministic hybrid and stochastic combinatorial optimization treatments of an electronic product disassembly line

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 that is feasible, minimizes the number of 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 here to be 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.

Citation

McGovern, S.M. and Gupta, S.M. (2006), "Deterministic hybrid and stochastic combinatorial optimization treatments of an electronic product disassembly line", Lawrence, K.D. and Klimberg, R.K. (Ed.) Applications of Management Science: In Productivity, Finance, and Operations (Applications of Management Science, Vol. 12), Emerald Group Publishing Limited, Leeds, pp. 175-197. https://doi.org/10.1016/S0276-8976(06)12013-1