 |
Kim, Min Geun (김민근)
Email:
Research Area:
Semester: 2011-03-01
2013 M.S. Graduation Thesis:
Scheduling algorithms for remanufacturing systems with parallel flow-shop-type reprocessing lines
This study considers the operations scheduling problem in remanufacturing systems that consist of a single disassembly workstation, parallel flow-shop-type reprocessing lines and a single reassembly workstation. End-of-use/life products are separated into its components at the disassembly workstation, then each component is reprocessed at one of dedicated flow-shop-type reprocessing lines. Finally, the reprocessed components are reassembled into the remanufactured products at the reassembly workstation. The problem is to determine the sequence of products to be disassembled, the sequence of components to be reprocessed at each stage of flow-shop-type reprocessing lines and the sequence of products to be reassembled. The objective is to minimize the total flow time. To represent the problem mathematically,
an integer programming model is developed. Due to the complexity of the problem, we suggest two types of heuristics: (a) modified NEH heuristic; and iterated greedy algorithm. To show the performances of the heuristics, computational experiments were done on various test instances. The performances of various priority rules, including newly developed ones, are compared in a numerical example.
Lab Seminars:
| 1. |
Job shop scheduling with beam search |
2011.7.5 |
| 2. |
The shifting bottleneck procedure for job shop scheduling. |
2011.7.26 |
| 3. |
Improving the location of minisum facilities through network modification. |
2010.2.24 |
|
