Determining optimum and suboptimum disassembly sequences with an application to a cell phone

Abstract

We study the disassembly process of a moderately complex consumer product (cell phone)

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)…”

GEN-PRODIS Approach for Determining Total Cost in Disassembly Sequencing Problem

“…In this paper we considered a specific product (cell phone) and its component are discussed below. [9] The optimal sequence is found using disassembly precedence graph (DPG). In his paper, heuristic method has been applied to the cell phone problem, aimed both at evaluating the solutions and at searching for a cluster of suboptimum solutions.…”

Methods for optimum and near optimum disassembly sequencing

“…This is related to the convergence of the procedure, which depends on the instance of the problem, i.e., the actual values of the elements of the profit matrix. Lambert and Gupta (2005b) presented the calculation for a particular instance, which could be optimally solved without encountering any problem. We also encountered some unfavorable instances, such as the one that has been taken as an example here.…”

“…An instance of the cell phone case of Figure 3 was solved and discussed by Lambert and Gupta (2005b) at modest expense of CPU time.…”