Disassembly line balancing with limited supply and subassembly availability

Date

2003-10-30

Author

Altekin, FT
Kandiller, L
Özdemirel, Nur Evin

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

266
views

0
downloads

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.

Subject Keywords

Line balancing, Disassembly, Product recovery

URI

https://hdl.handle.net/11511/33125

DOI

https://doi.org/10.1117/12.516073

Collections

Department of Industrial Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

A stochastic disassembly line balancing problem with hazardous tasks Göksoy Kalaycılar, Eda; Batun, Sakine; Department of Industrial Engineering (2020-11) In this thesis, we study a Stochastic Disassembly Line Balancing Problem (SDLBP) with hazardous tasks. We define success and failure events for each hazardous task and describe several scenarios over all hazardous tasks. Our aim is to maximize expected profit over all scenarios. We construct mathematical model with one, two and three hazardous tasks. Then, general formulation both in nonlinear and linear form is studied. We test the performance of the model on randomly generated data using the networks take...
Remedial actions for disassembly lines with stochastic task times ALTEKİN, FATMA TEVHİDE; Bayındır, Zeynep Pelin; Gumuskaya, Volkan (2016-09-01) We suggest the incorporation of remedial actions for profit-oriented disassembly lines with stochastic task times. When task times are stochastic, there is a probability that some of the tasks are not completed within the predefined cycle time. For-task incompletions in disassembly lines, pure remedial actions of stopping the line and offline disassembly are proposed along with the hybrid line which is a combination of the two pure remedial actions. The remedial actions have a significant effect on the expe...
Profit-oriented disassembly line balancing with stochastic task times in hybrid lines Gümüşkaya, Volkan; Bayındır, Zeynep Pelin; Altekin, Tevhide; Department of Industrial Engineering (2013) We offer a solution approach for profit-oriented disassembly line balancing problem in hybrid lines with stochastic task times. When task times are stochastic, there is a probability that some of the tasks are not completed within the predefined cycle time. For task incompletions, the most commonly used remedial actions are stopping the line or offline repairs. Stopping the line is to stop the line until the incomplete tasks are completed, while in offline repair, incomplete tasks are completed in an offlin...
Disassembly line balancing problem with fixed number of workstations and finite supply Göksoy, Eda; Azizoğlu, Meral; Department of Industrial Engineering (2010) In this thesis, we consider a Disassembly Line Balancing Problem (DLBP) with fixed number of workstations. We aim to maximize the total value of the recovered parts. We assume that there is a limited supply for the products to be disassembled. Different components can be obtained by disassembling different units of the product. Our aim is to assign the tasks to the workstations of the disassembly line so as to maximize the total value of the recovered parts. We present several upper and one lower bounding p...
Profit oriented disassembly line balancing Altekin, Fatma Tevhide; Kandiller, Levent; Department of Industrial Engineering (2005) In this study, we deal with the profit oriented partial disassembly line balancing problem which seeks a feasible assignment of selected disassembly tasks to stations such that the precedence relations among the tasks are satisfied and the profit is maximized. We consider two versions of this problem. In the profit maximization per cycle problem (PC), we maximize the profit for a single disassembly cycle given the task times and costs, part revenues and demands and station costs. We propose a heuristic solu...

Citation Formats

F. Altekin, L. Kandiller, and N. E. Özdemirel, “Disassembly line balancing with limited supply and subassembly availability,” 2003, vol. 5262, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/33125.