Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 27 of 27
Full-Text Articles in Engineering
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 …
Capacity And Buffer Trade-Offs In A Remanufacturing System, Hasan Kivanc Aksoy, Surendra M. Gupta
Capacity And Buffer Trade-Offs In A Remanufacturing System, Hasan Kivanc Aksoy, Surendra M. Gupta
Surendra M. Gupta
In this paper, we examine the tradeoffs between increasing the number of buffers and increasing the capacity at the remanufacturing stations under numerous circumstances on such performance measures as expected total cost, average WIP inventory, throughput and average processing (remanufacturing) time when the remanufacturing stations are operating in uncertain environments. We model the remanufacturing system using an open queueing network with finite buffers and unreliable servers. In order to analyze the queueing network, we use the decomposition principle and expansion methodology. Each server in the system is subject to breakdown and has a finite buffer capacity.
Economic Analysis Of End-Of-Life Computer Systems In Educational Institutions, Elif A. Kizilkaya, Surendra M. Gupta, Dincer Mehmet
Economic Analysis Of End-Of-Life Computer Systems In Educational Institutions, Elif A. Kizilkaya, Surendra M. Gupta, Dincer Mehmet
Surendra M. Gupta
In this paper we address the operational and economical aspects of EOL computer systems at educational institutions. To this end we present an actual case study of a major university in Boston and provide an economical analysis of different options such as disposal, disassembly, recycling, reuse and re-sale of these systems. We recommend a new procedure that will improve the collection and handling processes leading to a structured decision making methodology.
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 …
Sensor-Embedded Computers For Better Life-Cycle Management, Sagar V. Kamarthi, Surendra M. Gupta, Zeid Ibrahim, Vadde Srikanth
Sensor-Embedded Computers For Better Life-Cycle Management, Sagar V. Kamarthi, Surendra M. Gupta, Zeid Ibrahim, Vadde Srikanth
Surendra M. Gupta
This research investigates the advantages offered by embedded sensors for cost-effective and environmentally benign product life cycle management for desktop computers. During their use by customers as well as at the end of their lives, Sensor Embedded Computers (SECs) by virtue of sensors embedded in them generate data and information pertaining to the conditions and remaining lives of important components such as hard-drive, motherboard, and power supply unit. A computer monitoring framework is proposed to provide more customer comfort, reduce repair costs and increase the effectiveness of current disassembly practices. The framework consists of SECs, remote monitoring center (RMC), repair/service, …
Multi-Kanban Mechanism For Personal Computer Disassembly, Surendra M. Gupta, Kamarthi V. Sagar, Udomsawat Gun
Multi-Kanban Mechanism For Personal Computer Disassembly, Surendra M. Gupta, Kamarthi V. Sagar, Udomsawat Gun
Surendra M. Gupta
The use of personal computers (PCs) continues to increase every year. According to a 1999 figure, 50 percent of all US households owned PCs, a figure that continues to rise every year. With continuous development of sophisticated software, PCs are becoming increasingly powerful. In addition, the price of a PC continues to steadily decline. Furthermore, the typical life of a PC in the workplace is approximately two to three years while in the home it is three to five years. As these PCs become obsolete, they are replaced and the old PCs are disposed of. It is estimated that between …
Optimum Disassembly Sequencing, Surendra M. Gupta, A. J. D. Lambert
Optimum Disassembly Sequencing, Surendra M. Gupta, A. J. D. Lambert
Surendra M. Gupta
We consider the disassembly sequencing problem subjected to sequence dependent disassembly costs. Because most of the available methods that deal with such problems rely on metaheuristic and heuristic methods, it is desirable to have exact methods available that can at least be applied to medium sized problems to determine if the heuristically obtained solutions are acceptable or not. The conventional integer linear programming (ILP) approaches become unmanageable even for modest product complexity cases. In this paper, we propose an iterative method that repeatedly solves a binary integer linear programming (BILP) problem. The method converges quickly for medium sized problems. We …
Disassembly Line Balancing, Askiner Gungor, Surendra M. Gupta
Disassembly Line Balancing, Askiner Gungor, Surendra M. Gupta
Surendra M. Gupta
In this paper, we discuss a new problem, the disassembly line balancing problem (DLBP), which can simply be defined as the optimum assignment of disassembly tasks to the disassembly workstations under the condition that the precedence relationships among the tasks are not violated. The objectives are to meet the demand and to utilize the disassembly line as efficiently as possible. We present a systematic approach to solve a simple DLBP. An example is also presented to illustrate the approach.
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
Surendra M. Gupta
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
Surendra M. Gupta
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 …
The Effect Of Sudden Server Breakdown On The Performance Of A Disassembly Line, Surendra M. Gupta, Gun Udomsawat
The Effect Of Sudden Server Breakdown On The Performance Of A Disassembly Line, Surendra M. Gupta, Gun Udomsawat
Surendra M. Gupta
Product and material recovery relies on the disassembly process to separate target components or materials from the end-of-life (EOL) products. Disassembly line is especially effective when products in large quantity are disassembled. Unlike an assembly line, a disassembly line is more complex and is subjected to numerous uncertainties including stochastic and multi-level arrivals of component demands, stochastic arrival times for EOL products, and process interruption due to equipment failure. These factors seriously impair the control mechanism in the disassembly line. A common production control mechanism is the traditional push system (TPS). TPS responds to the aforementioned complications by carrying substantial …
Complications In Disassembly Line Balancing, Askiner Gungor, Surendra M. Gupta, Kishore Pochampally, Sagar V. Kamarthi
Complications In Disassembly Line Balancing, Askiner Gungor, Surendra M. Gupta, Kishore Pochampally, Sagar V. Kamarthi
Surendra M. Gupta
Disassembly line is, perhaps, the most suitable way for the disassembly of large products or small products in large quantities. In this paper, we address the disassembly line balancing problem (DLBP) and the challenges that come with it. The objective of balancing the disassembly line is to utilize the disassembly line in an optimized fashion while meeting the demand for the parts retrieved from the returned products. Although, the traditional line balancing problem for assembly has been studied for a long time, so far, no one has formally talked about the DLBP. In this work, our primary objective is to …
Optimizing The Supply Chain In Reverse Logistics, Surendra M. Gupta
Optimizing The Supply Chain In Reverse Logistics, Surendra M. Gupta
Surendra M. Gupta
Supply chain planning systems in reverse logistics present the industry with new problems that demand new approaches. The specific problem of the reverse logistics for the end-of-life (EOL) products addressed in this study is to determine the number of products to disassemble in a given time period to fulfill the demand of various components during that and subsequent time periods. We present a mathematical programming based model to solve the problem. When the problem is solved, it gives the number and timing of each product type to be disassembled in order to fulfill the demand of components needed at minimal …
Algorithms For Disassembly Scheduling, Surendra M. Gupta, Karim N. Taleb
Algorithms For Disassembly Scheduling, Surendra M. Gupta, Karim N. Taleb
Surendra M. Gupta
This paper presents the basic structure for two disassembly scheduling algorithms applied to a single product structure. The first algorithm addresses the case when all items in the product are unique. The second algorithm accounts for common items.
Modeling And Simulation Of The Disassembly Operations And The Associated Communications Network, Surendra M. Gupta
Modeling And Simulation Of The Disassembly Operations And The Associated Communications Network, Surendra M. Gupta
Surendra M. Gupta
Recently work has been done about simulation and analysis of manufacturing operations combined with the communications network it operates with. However no such methodology exists in disassembly line context. In this paper, we attempt to enhance their approach and apply it for a disassembly line. To this end, we look at a disassembly line system as a combination of physical processing (performed by machines) and information processing (performed by computer systems), and formulate a model to analyze the system behavior and to obtain an optimal or near optimal solution that would maximize the system performance by minimizing the risk of …
A Supply Chain Optimization Approach For Reverse Logistics Of End-Of-Life Products, Surendra M. Gupta, Yung-Joon Lee, Pitipong Veerakamolmal
A Supply Chain Optimization Approach For Reverse Logistics Of End-Of-Life Products, Surendra M. Gupta, Yung-Joon Lee, Pitipong Veerakamolmal
Surendra M. Gupta
In this paper, the main focus is on an optimization approach to determine the supply of a variety of products to recover (at the end of their lives) in order to fulfill the demand of an assortment of components, and have an environmentally benign policy of minimizing waste generation. When the problem is solved, it gives the number of each product type to be disassembled in order to fulfill the demand of components needed at minimal cost. From the supply chain perspective, this would result in minimal inventory requirements at both ends of the reverse logistics chain, viz., at the …
Planning Components Recovery From Multiple Products, Surendra M. Gupta, Pitipong Veerakamolmal
Planning Components Recovery From Multiple Products, Surendra M. Gupta, Pitipong Veerakamolmal
Surendra M. Gupta
This paper presents a two-stage model that provides a unique solution for planning components recovery from products with components commonality. The objective of the model is to determine the number and type of products to disassemble, to fulfill the demand of various components, in order to minimize disassembly and disposal costs.
Controlling Disassembly Line With Multi-Kanban System, Surendra M. Gupta, Gun Udomsawat
Controlling Disassembly Line With Multi-Kanban System, Surendra M. Gupta, Gun Udomsawat
Surendra M. Gupta
A way to implement the pull system in a disassembly line is to use a multi-kanban model. The model employs several types of kanbans attached to both components and subassemblies. The heart of the system lies in the kanban routing mechanism which allows routing of kanbans in multi-directions based on real time conditions. This mechanism creates minimum amount of residual inventory while satisfying varying demand levels. It also helps regulate the requests for subassembly from upstream workstations when a breakdown occurs at a workstation. This reduces blockage and starvation of subassemblies at workstations other than the broken workstation. In this …
Multikanban Model For Disassembly Line With Demand Fluctuation, Gun Udomsawat, Surendra M. Gupta, Yousef A. Y. Al-Turki
Multikanban Model For Disassembly Line With Demand Fluctuation, Gun Udomsawat, Surendra M. Gupta, Yousef A. Y. Al-Turki
Surendra M. Gupta
In recent years, the continuous growth in consumer waste and dwindling natural resources has seriously threatened the environment. Realizing this, several countries have passed regulations that force manufacturers not only to manufacture environmentally conscious products, but also to take back their used products from consumers so that the components and materials recovered from the products may be reused and/or recycled. Disassembly plays an important role in product recovery. A disassembly line is perhaps the most suitable setting for disassembly of products in large quantities. Because a disassembly line has a tendency to generate excessive inventory, employing a kanban system can …
Modeling Of Disassembly And Associated Token Ring, Surendra M. Gupta, Goner Argon
Modeling Of Disassembly And Associated Token Ring, Surendra M. Gupta, Goner Argon
Surendra M. Gupta
Communication networks play an increasingly important role in assembly and disassembly systems. Most of the works published recently to analyze such systems use simulation. However, these works have typically focused on Carrier Sense Multiple Access protocol and none of the studies address the performance of Token Ring protocol for such applications. In this paper, we attempt to fill this void. To this end, we analyze a disassembly system that is a combination of physical manifold (performed by machines) and information network (performed by computers). We develop a model to analyze the system's behavior and attemt to obtain an optimal or …
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 …
Remanufacturing Control In Multistage Systems With Stochastic Recovery Rates, Surendra M. Gupta
Remanufacturing Control In Multistage Systems With Stochastic Recovery Rates, Surendra M. Gupta
Surendra M. Gupta
Remanufacturing operations are involved with highly uncertain recovery rate of used products, subassemblies and parts that complicate the planning and control of the process. In this paper, we develop a comprehensive procedure that determines the optimal input quantities at each stage of the remanufacturing operations in which recovery rates at each stage of the process are stochastic. We model the remanufacturing system as an open queueing network and use the decomposition principle and expansion methodology to analyze it. Each station in the system is subject to breakdown and has a finite buffer capacity. Repair times, breakdown times and service times …
Generating A Disassembly-To-Order Plan, Surendra M. Gupta, Prasit Imtanavanich
Generating A Disassembly-To-Order Plan, Surendra M. Gupta, Prasit Imtanavanich
Surendra M. Gupta
The main objective of this research is to effectively solve a disassembly-to-order (DTO) problem. DTO is a system where a variety of returned products are disassembled to fulfill the demand for specified numbers of components and materials. Therefore, the optimal DTO plan must be generated in order to satisfy all demands, as well as to maximize profit and minimize costs of the system. Techniques implemented to solve the problem are Genetic Algorithm (GA), Linear Physical Programming (LPP) and refining algorithm. In this paper, we describe how GA and LPP techniques together with a refining algorithm can be combined to solve …
Case-Based Reasoning Disassembly System, Ibrahim Zeid, Surendra M. Gupta, Li Pan
Case-Based Reasoning Disassembly System, Ibrahim Zeid, Surendra M. Gupta, Li Pan
Surendra M. Gupta
This paper presents a new approach to address the problem of Planning for Disassembly (PFD). The approach is based on the Case-based reasoning technique. To assist planners to solve PFD problems, a system must have some heuristics and domain specific knowledge, which is related to the representation of the disassembly knowledge. In previous work, the authors suggested to use EMOPs (Eposodic Memory Organization Packet) for the knowledge representation of the PFD plan. This paper demonstrates the implementation of the EMOP memory model. The model has been implemented in C++, and tested. An example is presented to demonstrate the capabilities of …