Abstract
In this paper, we discuss a new problem, the disassembly line balancing problem (DLBP), which can simply be defined as the optimum assignment of disassembly tasks to the disassembly workstations under the condition that the precedence relationships among the tasks are not violated. The objectives are to meet the demand and to utilize the disassembly line as efficiently as possible. We present a systematic approach to solve a simple DLBP. An example is also presented to illustrate the approach.
Keywords
Disassembly line balancing problem (DLBP), Disassembly
Subject Categories
Recycling (Waste (etc.))
Disciplines
Engineering
Publisher
Omnipress
Publication Date
1999
Rights Information
Copyright 1999, Surendra M. Gupta
Rights Holder
Surendra M. Gupta
Permanent URL
Recommended Citation
Gungor, Askiner and Gupta, Surendra M., "Disassembly line balancing" (1999). . Paper 40. http://hdl.handle.net/2047/d10014044
Click button above to open, or right-click to save.
Notes
Originally published in the Proceedings of the 1999 Annual Meeting of the Northeast Decision Sciences Institute, Newport, Rhode Island, March 24-26, pp. 193-195, 1999