Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이동호 | - |
dc.date.accessioned | 2018-03-01T01:52:36Z | - |
dc.date.available | 2018-03-01T01:52:36Z | - |
dc.date.issued | 2012-09 | - |
dc.identifier.citation | 산업경영시스템학회지 Journal of the Society of Korea Industrial and Systems Engineering, 2012, 35(3), P.77-86. | en_US |
dc.identifier.issn | 2005-0461 | - |
dc.identifier.uri | http://scholar.dkyobobook.co.kr/searchDetail.laf?barcode=4010023495084# | - |
dc.identifier.uri | http://hdl.handle.net/20.500.11754/41396 | - |
dc.description.abstract | We consider the capacitated lot-sizing and scheduling problem for a paper remanufacturing system that produces several types of corrugated cardboards. The problem is to determine the lot sizes as well as the sequence of lots for the objective of minimizing the sum of setup and inventory holding costs while satisfying the demand and the machine capacity over a given planning horizon. In particular, the paper remanufacturing system has sequence-dependent setup costs that depend on the type of product just completed and on the product to be processed. Also, the setup state at one period can be carried over to the next period. An integer programming model is presented to describe the problem. Due to the complexity of the problem, we modify the existing two-stage heuristics in which an initial solution is obtained and then it is improved using a multi-pass interchange method. To show the performances of the heuristics, computational experiments were done using the real data, and a significant amount of improvement is reported. We consider the capacitated lot-sizing and scheduling problem for a paper remanufacturing system that produces several types of corrugated cardboards. The problem is to determine the lot sizes as well as the sequence of lots for the objective of minimizing the sum of setup and inventory holding costs while satisfying the demand and the machine capacity over a given planning horizon. In particular, the paper remanufacturing system has sequence-dependent setup costs that depend on the type of product just completed and on the product to be processed. Also, the setup state at one period can be carried over to the next period. An integer programming model is presented to describe the problem. Due to the complexity of the problem, we modify the existing two-stage heuristics in which an initial solution is obtained and then it is improved using a multi-pass interchange method. To show the performances of the heuristics, computational experiments were done using the real data, and a significant amount of improvement is reported. | en_US |
dc.description.sponsorship | 본 논문은 한국연구재단 중견연구자 사업 및 2단계 BK21사업의 지원을 받아 수행된 연구입니다(과제번호 : 2011-0015888). 또한, 본 연구에 필요한 자료를 제공한 (주)동일제지에도 감사드립니다. | en_US |
dc.language.iso | ko_KR | en_US |
dc.publisher | 한국산업경영시스템학회 The Society of Korea Industrial and Systems Engineering | en_US |
dc.subject | Capacitated Lot-Sizing and Scheduling | en_US |
dc.subject | Heuristics | en_US |
dc.subject | Paper Mill | en_US |
dc.subject | Case Study | en_US |
dc.title | 제지 재제조 시스템에서의 자원제약을 고려한 로트 크기 결정 및 일정 계획에 대한 사례연구 | en_US |
dc.title.alternative | A Case Study on Capacitated Lot-sizing and Scheduling in a Paper Remanufacturing System | en_US |
dc.type | Article | en_US |
dc.relation.no | 3 | - |
dc.relation.volume | 35 | - |
dc.relation.page | 77-86 | - |
dc.relation.journal | 산업경영시스템학회지 | - |
dc.contributor.googleauthor | 김혁철 | - |
dc.contributor.googleauthor | 도형호 | - |
dc.contributor.googleauthor | 유재민 | - |
dc.contributor.googleauthor | 김준규 | - |
dc.contributor.googleauthor | 이동호 | - |
dc.contributor.googleauthor | Kim, Hyeok-Chol | - |
dc.contributor.googleauthor | Doh, Hyoung-Ho | - |
dc.contributor.googleauthor | Yu, Jae-Min | - |
dc.contributor.googleauthor | Kim, Jun-Gyu | - |
dc.contributor.googleauthor | Lee, Dong-Ho | - |
dc.relation.code | 2012215057 | - |
dc.sector.campus | S | - |
dc.sector.daehak | COLLEGE OF ENGINEERING[S] | - |
dc.sector.department | DEPARTMENT OF INDUSTRIAL ENGINEERING | - |
dc.identifier.pid | leman | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.