Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Solving Disassembly Sequence Planning Problems Using Combinatorial Optimization, Surendra M. Gupta, Seamus M. Mcgovern, Sagar V. Kamarthi
Solving Disassembly Sequence Planning Problems Using Combinatorial Optimization, Surendra M. Gupta, Seamus M. Mcgovern, Sagar V. Kamarthi
Surendra M. Gupta
Disassembly activities take place in various recovery operations including remanufacturing, recycling, and disposal. The disassembly line is the best choice for automated disassembly of returned products, a feature that will be become crucial in the future. It is, therefore, important that the disassembly line be designed and balanced so that it works as efficiently as possible. However, finding the optimal balance is computationally intensive with exhaustive search quickly becoming prohibitively large, even for relatively small products. In this paper, we solve the disassemb ly line balancing problem using combinatorial optimization techniques, which are instrumental in obtaining near-optimal solutions to problems …
Stochastic And Deterministic Combinatorial Optimization Solutions To An Electronic Product Disassembly Flow Shop, Surendra M. Gupta, Seamus M. Mcgovern
Stochastic And Deterministic Combinatorial Optimization Solutions To An Electronic Product Disassembly Flow Shop, Surendra M. Gupta, Seamus M. Mcgovern
Surendra M. Gupta
Disassembly takes place in remanufacturing, recycling and disposal, with a flow shop being the best choice for automation. The disassembly line balancing problem seeks a sequence which: is feasible, minimizes workstations, and ensures similar idle times, as well as other end-of-life specific concerns. Finding the optimal balance is computationally intensive due to exponential growth. Combinatorial optimization methods hold promise for providing solutions to the problem, which is proven NP-hard. Stochastic (genetic algorithm) and deterministic (greedy/hill-climbing hybrid heuristic) methods are presented and compared. Numerical results are obtained using a recent electronic product case study.
Metaheuristic Technique For The Disassembly Line Balancing Problem, Surendra M. Gupta, Seamus M. Mcgovern
Metaheuristic Technique For The Disassembly Line Balancing Problem, Surendra M. Gupta, Seamus M. Mcgovern
Surendra M. Gupta
The disassembly line is the best choice for automated disassembly of returned products. However, finding the optimal balance for a disassembly line is computationally intensive with exhaustive search quickly becoming prohibitively large. Metaheuristic techniques provide a general algorithmic framework that can be applied to this optimization problem. Although metaheuristics show promise in solving this complex problem, challenges exist in the variety of evaluation criteria available, a lack of disassembly-specific data sets for metaheuristic testing and a lack of performance analysis tools. In this paper, a balance performance measure is reviewed along with a sizeindependent a priori data set and graphical …