Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 이동호 | - |
dc.contributor.author | 김종민 | - |
dc.date.accessioned | 2020-02-18T01:40:32Z | - |
dc.date.available | 2020-02-18T01:40:32Z | - |
dc.date.issued | 2016-08 | - |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/125929 | - |
dc.identifier.uri | http://hanyang.dcollection.net/common/orgView/200000487258 | en_US |
dc.description.abstract | This study considers the operations scheduling problem in a remanufacturing system in which end-of-use/life products are separated into their components at a single disassembly workstation, then each component is reprocessed at one of parallel flow-shop-type reprocessing lines and finally, the reprocessed components are reassembled into remanufactured products at parallel reassembly workstations. The problem is to determine the sequence of products to be disassembled at the disassembly workstation, the sequence of components to be reprocessed at each workstation of the reprocessing lines, and the allocation and sequence of the products to be reassembled at each reassembly workstation. As an extension of the previous study, we consider a due-date based objective, i.e. minimizing the total tardiness. A mixed integer programming model is developed to represent the problem mathematically. Then, to solve the problem, a priority scheduling approach is suggested for practical applications. Simulation experiments were done on various test in-stances, and the results are reported. In particular, we show that the approach proposed in this study outperforms the existing one that determines the reprocessing and reassembly schedules according to the sequence of disassembling products. | - |
dc.publisher | 한양대학교 | - |
dc.title | 흐름공정 형태의 재가공 라인을 가진 재제조시스템에 납기 지연 최소화를 위한 우선순위 규칙 기반 스케줄링 알고리즘 | - |
dc.type | Theses | - |
dc.contributor.googleauthor | 김종민 | - |
dc.sector.campus | S | - |
dc.sector.daehak | 대학원 | - |
dc.sector.department | 산업공학과 | - |
dc.description.degree | Master | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.