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.

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

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



Click button above to open, or right-click to save.

Included in

Engineering Commons

Share

COinS