301 0

제지 재제조 시스템에서의 자원제약을 고려한 로트 크기 결정 및 일정 계획에 대한 사례연구

Title
제지 재제조 시스템에서의 자원제약을 고려한 로트 크기 결정 및 일정 계획에 대한 사례연구
Other Titles
A Case Study on Capacitated Lot-sizing and Scheduling in a Paper Remanufacturing System
Author
이동호
Keywords
Capacitated Lot-Sizing and Scheduling; Heuristics; Paper Mill; Case Study
Issue Date
2012-09
Publisher
한국산업경영시스템학회 The Society of Korea Industrial and Systems Engineering
Citation
산업경영시스템학회지 Journal of the Society of Korea Industrial and Systems Engineering, 2012, 35(3), P.77-86.
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.
URI
http://scholar.dkyobobook.co.kr/searchDetail.laf?barcode=4010023495084#http://hdl.handle.net/20.500.11754/41396
ISSN
2005-0461
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > INDUSTRIAL ENGINEERING(산업공학과) > Articles
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