Skip to Main content Skip to Navigation
Journal articles

Robust disassembly line balancing with ambiguous task processing times

Abstract : Disassembly line balancing problem (DLBP), which is to select disassembly process, open workstations and assign selected tasks to opened workstations, plays an important role in the recycling of End Of Life products. In real-world disassembly operations, task processing times are usually stochastic due to various factors. Most related works address the uncertain processing times by assuming that the probability distribution is known and the task processing times are independent of each other. In practice, however, it is difficult to get the complete distributional information and there is always underlying correlation between the uncertain processing times. This paper investigates the DLBP with partial uncertain knowledge, i.e. the mean and covariance matrix of task processing times. A new distributionally robust formulation with a joint chance constraint is proposed. To solve the problem, an approximated mixed integer second-order cone programming (MI-SOCP) model is proposed, and a two-stage parameter-adjusting heuristic is further developed. Numerical experiments are conducted, to evaluate the performance of the proposed method. We also draw some managerial insights and consider an extension problem.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02280475
Contributor : Frédéric Davesne <>
Submitted on : Friday, September 6, 2019 - 1:20:57 PM
Last modification on : Wednesday, February 19, 2020 - 1:11:42 AM

Identifiers

Citation

Ming Liu, Xin Liu, Feng Chu, Feifeng Zheng, Chengbin Chu. Robust disassembly line balancing with ambiguous task processing times. International Journal of Production Research, Taylor & Francis, In press, pp.1-30. ⟨10.1080/00207543.2019.1659520⟩. ⟨hal-02280475⟩

Share

Metrics

Record views

154