Disassembly line balancing with limited supply and subassembly availability

摘要

Disassembly line balancing problem (DLBP) aims at finding a feasible assignment of disassembly tasks to workstations such that precedence gelations among tasks are satisfied and some measure of effectiveness is optimized. We consider partial disassembly under limited supply of a single product as well as availability of its subassemblies. Hence, in satisfying the demand for revenue generating parts, both discarded products and available subassemblies can be utilized. We assume that part revenues and demand, task times and costs, inventory holding costs, and station opening costs are given. We propose two DLBP formulations. The first one maximizes the profit per disassembly cycle. The second formulation maximizes the profit over the whole planning horizon. Proposed formulations and computational results are presented.