Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 최경현 | - |
dc.contributor.author | 안재모 | - |
dc.date.accessioned | 2020-04-01T17:04:09Z | - |
dc.date.available | 2020-04-01T17:04:09Z | - |
dc.date.issued | 2010-02 | - |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/142640 | - |
dc.identifier.uri | http://hanyang.dcollection.net/common/orgView/200000413414 | en_US |
dc.description.abstract | This thesis deals with a scheduling problems of the corrugated paper production. Corrugated paper is produced by gluing multi types of paper of the same breadth. Given a set of orders, we first assign each order to one of the standard breadths, and then sequence those assigned to each standard breadth so that they are continuously manufactured without unnecessary roll change. We propose two mathematical optimization models to make decision for assigning orders to standard breadths and sequencing orders of each standard breadth. The objective of the proposed model is to minimize the total amount of paper loss and total setup time due to roll change. The proposed process firstly selects lot causes minimum paper loss and secondly satisfies machine capacity by moving orders to other machine or assigning orders for next work cycle. Then finally sequencing problem is solved by genetic algorithms. To this end, we have tested the proposed process comparing with the existing corrugated paper scheduling methods, We see that the proposed models reduce the loss of raw material and time waste. | - |
dc.publisher | 한양대학교 | - |
dc.title | 골판지 생산 일정계획 수립에 관한 연구 | - |
dc.title.alternative | A study on scheduling in a corrugated paper production system | - |
dc.type | Theses | - |
dc.contributor.googleauthor | 안재모 | - |
dc.contributor.alternativeauthor | Ahn, Jae Mo | - |
dc.sector.campus | S | - |
dc.sector.daehak | 대학원 | - |
dc.sector.department | 산업공학과 | - |
dc.description.degree | Master | - |
dc.contributor.affiliation | 산업공학 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.