Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Entire DC Network
Greedy Algorithm For Disassembly Line Scheduling, Seamus M. Mcgovern, Surendra M. Gupta
Greedy Algorithm For Disassembly Line Scheduling, Seamus M. Mcgovern, Surendra M. Gupta
Surendra M. Gupta
Remanufacturing, recycling, and disposal recovery operations require the performance of disassembly activities. The disassembly line is the best choice for automated disassembly of returned products, however, finding the optimal balance is computationally intensive with exhaustive search quickly becoming prohibitively large. In this paper, a greedy algorithm is presented for obtaining optimal or near-optimal solutions to the disassembly line balancing problem. The greedy algorithm is a first-fit decreasing algorithm further enhanced to preserve precedence relationships. The algorithm seeks to minimize the number of workstations while accounting for hazardous and high demand components. A hill-climbing heuristic is then developed to balance the …
Product Recovery Using A Disassembly Line : Challenges And Solution, Surendra M. Gupta, Askiner Gungor
Product Recovery Using A Disassembly Line : Challenges And Solution, Surendra M. Gupta, Askiner Gungor
Surendra M. Gupta
Disassembly plays an important role in product recovery by allowing selective separation of desired parts and materials. The disassembly line is the best choice for automated disassembly of returned products, a feature that will be essential in the future. It is, therefore, important that the disassembly line be designed and balanced so that it works as efficiently as possible. In this paper, the authors address the disassembly line balancing problem and the challenges that come with it.
Determining Optimum And Suboptimum Disassembly Sequences With An Application To A Cell Phone, A.J.D. (Fred) Lambert, Surendra M. Gupta
Determining Optimum And Suboptimum Disassembly Sequences With An Application To A Cell Phone, A.J.D. (Fred) Lambert, Surendra M. Gupta
Surendra M. Gupta
We study the disassembly process of a moderately complex consumer product (cell phone) consisting of 25 components. The investigation involves a heuristically solved disassembly line balancing problem and the determination of an appropriate disassembly sequence influenced by sequence-dependent costs, which is based on a novel combination of exact and heuristic algorithms. The issue of generating various suboptimum solutions to cope with multiple optimization criteria is also discussed.
A Stochastic Inventory Management Approach In The Disassembly Line Portion Of Reverse Logistics, Badr O. Johar, Surendra M. Gupta
A Stochastic Inventory Management Approach In The Disassembly Line Portion Of Reverse Logistics, Badr O. Johar, Surendra M. Gupta
Surendra M. Gupta
Reverse logistics is a critical topic that has captured the attention of government, private entities and researchers in recent years. This increase in the concern was driven by current set of government regulations, increase of public awareness, and the attractive economic opportunities. As a result, many corporations have started to comprehend the importance of the recovery process and are taking serious steps in restructuring their supply chain processes to meet the new regulations such as limitations on waste disposal and recycling requirements [1]. Because of the unique problems associated with reverse supply chain and the complex nature of the reverse …