Disassembly line balancing problem (DLBP) aims at finding a feasible assignment of disassembly tasks to workstations such that precedence relations 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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.