 |
Lee, Kwang Bok (이광복)
Email:
Research Area:
Occupation: SajoHaepyo
2008 M.S. Graduation Thesis:
Heuristic Algorithms for the Mixed-Model Disassembly-Line Balancing Problem
During the last decades, growing concerns on environmental issues have enforced the industry to develop environmentally conscious products and their processes. Among others the disassembly process, one of the elements in product recovery system, was the most based on in the product process system. This dissertation considers the line balancing problem for designing disassembly systems called the disassembly line balancing problem (DLBP) in the literature. For a given disassembly process plan that specifies all parts and components together with necessary disassembly tasks, the DLBP is to assign individual disassembly tasks to workstations while satisfying the precedence relations among tasks. As an extension of the existing research, this dissertation considers a mixed-model version of the DLBP since multiple used or end-of-life products are usually disassembled in ordinary disassembly systems. The objective is to minimize the number of workstations. A 0-1 integer programming model is presented to describe the problem mathematically. Since the problem considered in this dissertation is NP-hard, this dissertation suggests several simple heuristic algorithms in which disassembly tasks are ordered using a certain priority rule and then they are assigned to workstations according to this order while considering a given cycle time and precedence relations among tasks. Computational experiments were done on a number of test problems up to 500 tasks, and the results are reported. In particular, some of the heuristics gave the near optimal solutions for most small-size test problems.
Lab Seminars:
| 1. |
A heuristic for solving mixed model line balancing problems with stochastic task durations and parallel stations (2.15) |
2007 |
| 2. |
Handling the assembly line balancing problem in the clothing industry using a genetic algorithm (1.25) |
2007 |
| 3. |
A branch and bound based solution approach for the mixed model assembly line balancing problem for minimizing stations and task duplication costs (1.4) |
2007 |
| 4. |
Algorithms for flexible flow shop problems with unrelated parallel machine, setup times, and dual criteria (8.7) |
2007 |
| 5. |
Schedulinh multi-stage parallel-processor services to minimize average response time (8.21) |
2007 |
| 6. |
Minimizing makespan in re-entrant permutation flow-shops (7.18) |
2007 |
| 7. |
A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem (6.29) |
2007 |
|
