An exact solution approach for disassembly line balancing problem under uncertainty of the task processing times

Abstract

International audienceThe purpose of this work is to efficiently design disassembly lines taking into account the uncertainty of task processing times. The main contribution of the paper is the development of a decision tool that allows decision-makers to choose the best disassembly alternative (process), for an End of Life product (EOL), and assign the corresponding disassembly tasks to the workstations of the line under precedence and cycle time constraints. Task times are assumed to be random variables with known normal probability distributions. The case of presence of hazardous parts is studied and cycle time constraints are to be jointly satisfied with at least a certain probability level, or service level, fixed by the decision-maker. An AND/OR graph is used to model the precedence relationships among tasks. The objective is to minimise the line cost composed of the workstation operation costs and additional costs of workstations handling hazardous parts of the EOL product. To deal with task time uncertainties, lower and upper-bounding schemes using second-order cone programming and approximations with convex piecewise linear functions are developed. The applicability of the proposed solution approach is shown by solving to optimality a set of disassembly problem instances (EOL industrial products) from the literature

A disassembly line balancing problem with fixed number of workstations

“…Bentaha et al 2014c proposed a lagrangian relaxation approach to maximize the total profit. Bentaha et al (2015) considered the problem of minimizing the workstation operation costs and additional costs for handling the hazardous parts. They developed several lower and upper bounding mechanisms.…”

Disassembly line balancing problem: a review of the state of the art and future directions

“…Hazardous work-pieces 55 Güngör and Gupta (1999a; Güngör et al (2000); Gupta and Güngör (2001); McGovern and Gupta (2003a; McGovern, ; Gupta (2004, 2005); Lambert and Gupta (2005b); Wang et al (2011); Avikal and Mishra (2012); Karadağ and Türkbey (2013); Avikal et al (2013cAvikal et al ( , 2014cAvikal et al ( , 2016; Kalayci and Gupta (2011a; Bentaha et al (2013bBentaha et al ( , 2013aBentaha et al ( , 2014e, 2014bBentaha et al ( , 2014dBentaha et al ( , 2015aBentaha et al ( , 2015b; ; ; Kalayci et al (2011Kalayci et al ( , 2015aKalayci et al ( , 2015b McGovern and ; Lambert and Gupta (2005b); Ding et al (2009Ding et al ( , 2010b; Wang et al (2011); Avikal and Mishra (2012); Avikal et al (2013cAvikal et al ( , 2014cAvikal et al ( , 2016; Kalayci and Gupta (2011a; ; ; Kalayci et al (2011Kalayci et al ( , 2015bKalayci et al ( , 2015a (No complication) 28 ; Ranky et al (2003); McGovern and Gupta (2004); Lambert and Gupta (2005a); Tang and Zhou (2006); ; ; ; ;…”

“…Linear Programming ; ; Altekin, Bayındır, and Gümüşkaya (2016); Lambert and Gupta (2005b); ; Altekin and Akkan 2012 McGovern and ; ; Özceylan and Paksoy (2013Özceylan and Paksoy ( , 2014aÖzceylan and Paksoy ( , 2014bÖzceylan and Paksoy ( , 2014c; ; ; Bentaha et al (2014dBentaha et al ( , 2015aBentaha et al ( , 2015b; Kannan et al (2017) Heuristic Güngör and Gupta (1999a; Güngör et al (2000); Gupta and Güngör (2001); ; ; Tang and Zhou (2006) McGovern, ; McGovern and Gupta (2004; Kalayci, Gupta, and Nakashima (2011); Karadağ and Türkbey (2013); ; ; Seidi and Saghari (2016)…”

Design for manufacturing and assembly/disassembly: joint design of products and production systems

“…Altekin (2017) presented two second-order cone programming and five piecewise linear, mixed-integer programming models for stochastic disassembly line-balancing problem with complete disassembly to minimise the number of workstations. The uncertainty of task processing times has been taken into consideration while developing a decision tool to select the best disassembly process for end-of-life product and assignment of disassembly tasks to workstations (Bentaha, Battaïa, and Dolgui 2015b). Hezer and Kara (2015) introduce the parallel DLB problem with single product U-type layout and present a network-based shortest route model for tackling the parallel DLB problem.…”