A disassembly line balancing problem with fixed number of workstations

Date

2016-03-01

Author

Kalaycilar, Eda Goksoy
Azizoğlu, Meral
Yeralan, Sencer

Metadata

Show full item record

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

Item Usage Stats

26
views

0
downloads

Cite This

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.

Subject Keywords

Integer programming, Heuristics, Disassembly lines, Linear programming relaxation, Lumped-circuit model, Dynamic-analysis, Array, Piston

URI

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

Collections

Department of Industrial Engineering, Article