323 0

흐름공정 형태의 재가공 라인을 가진 재제조시스템에 납기 지연 최소화를 위한 우선순위 규칙 기반 스케줄링 알고리즘

Title
흐름공정 형태의 재가공 라인을 가진 재제조시스템에 납기 지연 최소화를 위한 우선순위 규칙 기반 스케줄링 알고리즘
Author
김종민
Advisor(s)
이동호
Issue Date
2016-08
Publisher
한양대학교
Degree
Master
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.
URI
https://repository.hanyang.ac.kr/handle/20.500.11754/125929http://hanyang.dcollection.net/common/orgView/200000487258
Appears in Collections:
GRADUATE SCHOOL[S](대학원) > INDUSTRIAL ENGINEERING(산업공학과) > Theses (Master)
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE