Exact methods in optimum disassembly sequence search for problems subject to sequence dependent costs

Modeling and Optimisation of Precedence-Constrained Production Sequencing and Scheduling for Multiple Production Lines Using Genetic Algorithms

“…For similar problems, Duman & Or [5] developed an approach which initially ignores precedence relations and solves the problem as a pure travelling salesman problem (TSP), and then it is applied to eliminate component damage in the resulting TSP tour. Recently, a precedence-constrained sequencing problem (PCSP) in disassembly scheduling was formulated by modifying the two-commodity network flow model, carried out by Lambert [6].…”

Methods for optimum and near optimum disassembly sequencing

“…This method was extended to an AND/OR graph by Kang et al (2001). An adapted method with a reduced set of integer variables has been discussed by Lambert (2005). Binary integer linear programming (BILP) has been applied by Yee and Ventura (1999) to AND/OR graphs without parallelism and, consequently, without the possibility of generating short tours, i.e.…”

“…The authors also proposed a metaheuristic (Lagrangian relaxation) for extended problems. Iterative BILP has been applied by Lambert (2006) for solving general problems with DPGs, and by Lambert (2007) for AND/OR graphs. Metaheuristic methods are compiled by Santochi et al, (2001).…”

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

“…Exact methods are often based on mathematical programming with integer linear programming (ILP) and binary integer linear programming (BILP) being the most prevalent [3]. While both of these methods require exponentially increasing CPU times with growing product complexities, the BILP based method is more flexible and could be used for a broader range of product complexity.…”

“…The exact method [3,4,5] proceeds as follows: Let N o be the number of operations that are involved in the model. Start with N o = 1 and find the optimum solution, using a binary integer linear programming approach.…”