A network-based shortest route model for parallel disassembly line balancing problem

Disassembly lines should be balanced efficiently to increase productivity of the line and to reduce disassembly costs. This problem is called disassembly line balancing problem (DLBP). The objective of the DLBP is usually to find the minimum number of disassembly workstations required. This study introduces parallel DLBP (PDLBP) with single-product and proposes a network model based on the shortest route model (SRM) for solving PDLBP. The proposed model is illustrated via numerical examples. A comprehensive experiment is also conducted to evaluate problem-specific features of disassembly lines. To the best of our knowledge, this is the first study dealing with PDLBP. This paper will present a different point of view regarding DLBP.