Eda Göksoy KalaycilarMeral AzizoǧluSencer YeralanAzizoglu, MeralKalaycilar, Eda GöksoyYeralan, SencerAzizoʇlu, Meral2025-10-062016037722170377-22171872-686010.1016/j.ejor.2015.09.0042-s2.0-84952984791https://www.scopus.com/inward/record.uri?eid=2-s2.0-84952984791&doi=10.1016%2Fj.ejor.2015.09.004&partnerID=40&md5=6aa5453bd4940a34b52c553d1ae1e273https://gcris.yasar.edu.tr/handle/123456789/9809https://doi.org/10.1016/j.ejor.2015.09.004In 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. © 2016 Elsevier B.V. All rights reserved.Englishinfo:eu-repo/semantics/openAccessDisassembly Lines, Heuristics, Integer Programming, Linear Programming Relaxation, Linear Programming, Bounding Procedures, Computational Studies, Disassembly Line, Disassembly Line Balancing, Disassembly Operations, Finite Number, Heuristics, Linear Programming Relaxation, Integer ProgrammingLinear programming, Bounding procedures, Computational studies, Disassembly line, Disassembly line balancing, Disassembly operations, Finite number, Heuristics, Linear programming relaxation, Integer programmingDisassembly LinesLinear Programming RelaxationHeuristicsInteger ProgrammingConference Object