Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 9 of 9
Full-Text Articles in Engineering
Use Of Data Envelopment Analysis For Product Recovery, Nuriye Elif Kongar, Surendra M. Gupta, Seamus M. Mcgovern
Use Of Data Envelopment Analysis For Product Recovery, Nuriye Elif Kongar, Surendra M. Gupta, Seamus M. Mcgovern
Seamus McGovern
The latest enhancements in industrial technologies, especially the ones in electronics industry, have provided organizations with the ability to manufacture faster and more economical products. This fact, coupled with the growing interest and demand for the latest technology, have led electronic equipment manufacturers to start producing ""high-tech"" and ""personalized"" products at an increasing rate. This has led to a high rate of obsolescence for electronic products worldwide, even though the majority of these ""obsolete"" products still function. In this paper, we investigate a product recovery facility where the end-of-life (EOL) products are taken back from the last users and are …
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
Seamus McGovern
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 …
Multi-Criteria Ant System And Genetic Algorithm For End-Of-Life Decision Making, Surendra M. Gupta, Seamus M. Mcgovern
Multi-Criteria Ant System And Genetic Algorithm For End-Of-Life Decision Making, Surendra M. Gupta, Seamus M. Mcgovern
Seamus McGovern
Disassembly takes place in remanufacturing, recycling, and disposal with a line 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, disassembly-specific concerns. Finding the optimal balance is computationally intensive due to factorial growth. Ant colony optimization and genetic algorithm metaheuristics are presented and compared along with an exa mple to illustrate the implementation. Conclusions drawn include the consistent generation of optimal or near-optimal solutions, the ability to preserve precedence, the speed of the metaheuristics, and their practicality due to ease of …
Disassembly Sequencing Problem: A Case Study Of A Cell Phone, Evren Erbis, Seamus M. Mcgovern, Surendra M. Gupta
Disassembly Sequencing Problem: A Case Study Of A Cell Phone, Evren Erbis, Seamus M. Mcgovern, Surendra M. Gupta
Seamus McGovern
Selection of an optimal disassembly sequence is essential for the efficient processing of a product at the end of its life. Disassembly sequences are listings of disassembly actions (such as the separation of an assembly into two or more subassemblies, or removing one or more connections between components). Disassembly takes place in remanufacturing, recycling, and disposal with a disassembly line being the best choice for automation. In this paper, the disassembly sequencing problem is solved for a cell phone case on a disassembly line, seeking a sequence which is feasible, minimizes the number of workstations (and hence idle times), provides …
Computational Complexity Of A Reverse Manufacturing Line, Surendra M. Gupta, Seamus M. Mcgovern
Computational Complexity Of A Reverse Manufacturing Line, Surendra M. Gupta, Seamus M. Mcgovern
Seamus McGovern
Disassembly has recently gained attention in the literature due to its role in product recovery. 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. 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, due to exponential growth. In this paper, complexity theory is reviewed and used to prove that the DISASSEMBLY LINE …
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
Seamus McGovern
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.
Uninformed And Probabilistic Distributed Agent Combinatorial Searches For The Unary Np-Complete Disassembly Line Balancing Problem, Surendra M. Gupta, Seamus M. Mcgovern
Uninformed And Probabilistic Distributed Agent Combinatorial Searches For The Unary Np-Complete Disassembly Line Balancing Problem, Surendra M. Gupta, Seamus M. Mcgovern
Seamus McGovern
Disassembly takes place in remanufacturing, recycling and disposal, with a line 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 disassembly line balancing problem, which is proven here to belong to the class of unary NP-complete problems. Probabilistic (ant colony optimization) and uninformed (H-K) search methods are presented and compared. Numerical results are obtained using a recent …
Combinatorial Optimization Methods For Disassembly Line Balancing, Seamus M. Mcgovern, Surendra M. Gupta
Combinatorial Optimization Methods For Disassembly Line Balancing, Seamus M. Mcgovern, Surendra M. Gupta
Seamus McGovern
Disassembly takes place in remanufacturing, recycling, and disposal with a line being the best choice for automation. The disassembly line balancing problem seeks a sequence which: minimizes workstations, ensures similar idle times, and is feasible. Finding the optimal balance is computationally intensive due to factorial growth. Combinatorial optimization methods hold promise for providing solutions to the disassembly line balancing problem, which is proven to belong to the class of NP-complete problems. Ant colony optimization, genetic algorithm, and H-K metaheuristics are presented and compared along with a greedy/hill-climbing heuristic hybrid. A numerical study is performed to illustrate the implementation and compare …
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
Seamus McGovern
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 …