A disassembly line balancing problem with fixed number of workstations

2016-03-01
Kalaycilar, Eda Goksoy
Azizoğlu, Meral
Yeralan, Sencer
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 workstations that perform the necessary disassembly operations, referred to as tasks. We present several upper and lower bounding procedures that assign the tasks to the workstations so as to maximize the total net revenue. The computational study has revealed that the procedures produce satisfactory results. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

Suggestions

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...
A stochastic programming approach for the disassembly line balancing with hazardous task failures
Kalaycilar, Eda Goksoy; Batun, Sakine; Azizoğlu, Meral (2021-04-01)
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 prog...
Rebalancing the assembly lines: exact solution approaches
Sanci, Ece; Azizoğlu, Meral (2017-01-01)
In this study, we consider an assembly line rebalancing problem with disruptions caused by workstation breakdowns or shutdowns. After the disruption, we aim to find a rebalance so as to catch the trade-off between the efficiency measure of cycle time and stability measure of number of tasks assigned to different workstations in the original and new balances. Our aim is to generate all nondominated objective vectors with respect to the efficiency and stability measures. We develop two optimisation algorithms...
A fixed job scheduling problem with machine-dependent job weights
Eliiyi, D. T.; Azizoğlu, Meral (2009-01-01)
This study considers the identical parallel machines operational fixed job scheduling problem with machine-dependent job weights. A job is either processed in a fixed interval or is not processed at all. Our aim is to maximise the total weight of the processed jobs. We show that the problem with machine eligibility constraints resides as a special case of this problem. We identify some special polynomially solvable cases and propose a branch-and-bound (BB) algorithm that employs efficient bounding schemes a...
Citation Formats
E. G. Kalaycilar, M. Azizoğlu, and S. Yeralan, “A disassembly line balancing problem with fixed number of workstations,” EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, pp. 592–604, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36577.