A disassembly line balancing problem with fixed number of workstations

作者：Kalaycilar Eda Goksoy; Azizoglu Meral^*; Yeralan Sencer

来源：European Journal of Operational Research, 2016, 249(2): 592-604.

DOI：10.1016/j.ejor.2015.09.004

• Integer programming
• Heuristics
• Disassembly lines
• Linear programming relaxation

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.

• 出版日期2016-3-1