제지 재제조시스템에서의 자원제약을 고려한 로트크기 결정 및 일정계획에 대한 사례연구
A Case Study on Capacitated Lot-sizing and Scheduling in a Paper Remanufacturing System
0
조회
0
다운로드
2
인용
0
참고문헌
키워드
초록
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.
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.
참고문헌 (9)
- Bouchriha, H., "Lot sizing problem on a paper machine under a cyclic production approach", International Journal of Production Economics, 105(2), pp.318~328 (2007)
- Drexl, A., "Lot sizing and scheduling-survey and extensions", European Journal of Operational Research, 99(2), pp.221~235 (1997)
- Gupta, D., "The capacitated lotsizing scheduling problem with sequence-dependent setup costs and setup times", Computers and Operations Research, 32(4), pp.727~747 (2005)
- Haase, K., "Capacitated Lot-sizing with sequence dependent setup costs", OR Specktrum, 18(1), pp.51~59 (1996)
- Haase, K., "Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities", International Journal of Production Economics, 66(2), pp.159~169 (2000)
- Salomon, M., "Some Extensions of the Discrete Lotsizing and Scheduling Problem", Management Science, 37(7), pp.801~812 (1991)
- Shim, I. -S., "A two-stage heuristic for single machine capacitated lot-sizing and scheduling with sequence-dependent setup costs", Computers and Industrial Engineering, 61(4), pp.920~929 (2011)
- Trigeiro, W. W., "Capacitated lot sizing with setup times", Management Science, 35(3), pp.353~366 (1989)
- Zhu, X. Y., "Scheduling and lot sizing with sequence-dependent setup : a literature review", IIE Transactions, 31(11), pp.987~1007 (2006)