A stochastic programming approach for the disassembly line balancing with hazardous task failures

Date

2021-04-01

Author

Kalaycilar, Eda Goksoy
Batun, Sakine
Azizoğlu, Meral

Metadata

Show full item record

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

Item Usage Stats

295
views

0
downloads

We consider a partial disassembly line balancing problem with hazardous tasks whose successful completions are uncertain. When any hazardous task fails, it causes damages of the tasks on the workstation that it is performed on and all remaining tasks to be performed in the succeeding workstations. We attribute probabilities for the successful completion and failure of the hazardous tasks and aim to maximise the total expected net revenue. We formulate the problem as a two-stage stochastic mixed-integer programme where the assignment of the tasks to the workstations is decided in the first-stage, before the resolution of the uncertainty. We give the formulation for one, two and three hazardous tasks, and then extend to the arbitrary number of hazardous tasks. Our numerical results reveal that proposed stochastic programming models return satisfactory performance and can solve instances with up to 73 tasks very quickly. We observe that the number of tasks, number of hazardous tasks and success probabilities are the most significant parameters that affect the performance. We quantify the value of capturing uncertainty using the expected objective values attained by the solution of the stochastic model and that of the expected value model, and obtain very satisfactory results.

URI

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

Journal

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH

DOI

https://doi.org/10.1080/00207543.2021.1916119

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

A disassembly line balancing problem with fixed number of workstations Kalaycilar, Eda Goksoy; Azizoğlu, Meral; Yeralan, Sencer (2016-03-01) In this study, a Disassembly Line Balancing Problem with a fixed number of workstations is considered. The product to be disassembled comprises various components, which are referred to as its parts. There is a specified finite supply of the product to be disassembled and specified minimum release quantities (possible zero) for each part of the product. All units of the product are identical, however different parts can be released from different units of the product. There is a finite number of identical w...
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...
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...
Disassembly line balancing with limited supply and subassembly availability Altekin, FT; Kandiller, L; Özdemirel, Nur Evin (2003-10-30) 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,...
A simulated annealing approach to bicriteria scheduling problems on a single machine Karasakal, Esra (2000-08-01) In this paper, we apply a simulated annealing approach to two bicriteria scheduling problems on a single machine. The first problem is the strongly NP-hard problem of minimizing total flowtime and maximum earliness. The second one is the NP-hard problem of minimizing total flowtime and number of tardy jobs. We experiment on different neighbourhood structures as well as other parameters of the simulated annealing approach to improve its performance. Our computational experiments show that the developed appro...

Citation Formats

E. G. Kalaycilar, S. Batun, and M. Azizoğlu, “A stochastic programming approach for the disassembly line balancing with hazardous task failures,” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, pp. 0–0, 2021, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/90366.