Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Publication
- Publication Type
Articles 1 - 3 of 3
Full-Text Articles in Operations Research, Systems Engineering and Industrial 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
Seamus McGovern
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 …
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 …
Maximally Disjoint Solutions Of The Set Covering Problem, David J. Rader, Peter L. Hammer
Maximally Disjoint Solutions Of The Set Covering Problem, David J. Rader, Peter L. Hammer
Mathematical Sciences Technical Reports (MSTR)
This paper is concerned with finding two solutions of a set covering problem that have a minimum number of variables in common. We show that this problem is NP complete, even in the case where we are only interested in completely disjoint solutions. We describe three heuristic methods based on the standard greedy algorithm for set covering problems. Two of these algorithms find the solutions sequentially, while the third finds them simultaneously. A local search method for reducing the overlap of the two given solutions is then described. This method involves the solution of a reduced set covering problem. Finally, …