A Case Study on Capacitated Lot-sizing and Scheduling in a Paper Remanufacturing System

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

  • Kim, Hyeok-Chol (Department of Industrial Engineering, Hanyang University) ;
  • Doh, Hyoung-Ho (Department of Industrial Engineering, Hanyang University) ;
  • Yu, Jae-Min (Department of Industrial Engineering, Hanyang University) ;
  • Kim, Jun-Gyu (Department of Industrial Engineering, Hanyang University) ;
  • Lee, Dong-Ho (Department of Industrial Engineering, Graduate School of Technology and Innovation Management, Hanyang University)
  • 김혁철 (한양대학교 산업공학과) ;
  • 도형호 (한양대학교 산업공학과) ;
  • 유재민 (한양대학교 산업공학과) ;
  • 김준규 (한양대학교 산업공학과) ;
  • 이동호 (한양대학교 산업공학과/기술경영전문대학원)
  • Received : 2012.06.11
  • Accepted : 2012.09.07
  • Published : 2012.09.30

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.

Keywords

References

  1. Bouchriha, H., Ouhimmou, M., and D'Amours, S.; "Lot sizing problem on a paper machine under a cyclic production approach," International Journal of Production Economics, 105(2) : 318-328, 2007. https://doi.org/10.1016/j.ijpe.2005.07.001
  2. Drexl, A. and Kimms, A.; "Lot sizing and scheduling -survey and extensions," European Journal of Operational Research, 99(2) : 221-235, 1997. https://doi.org/10.1016/S0377-2217(97)00030-1
  3. Gupta, D. and Magnusson, T.; "The capacitated lotsizing scheduling problem with sequence-dependent setup costs and setup times," Computers and Operations Research, 32(4) : 727-747, 2005. https://doi.org/10.1016/j.cor.2003.08.014
  4. Haase, K.; "Capacitated Lot-sizing with sequence dependent setup costs," OR Specktrum, 18(1) : 51-59, 1996. https://doi.org/10.1007/BF01539882
  5. Haase, K. and Kimms, A.; "Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities," International Journal of Production Economics, 66(2) : 159-169, 2000. https://doi.org/10.1016/S0925-5273(99)00119-X
  6. Salomon, M., Kroon, L. G., Kuik, R., and Van Wassenhove L. N.; "Some Extensions of the Discrete Lotsizing and Scheduling Problem," Management Science, 37(7) : 801-812, 1991. https://doi.org/10.1287/mnsc.37.7.801
  7. Shim, I.-S., Kim, H.-C., Doh, H.-H., and Lee, D.-H.; "A two-stage heuristic for single machine capacitated lot-sizing and scheduling with sequence-dependent setup costs," Computers and Industrial Engineering, 61(4) : 920-929, 2011. https://doi.org/10.1016/j.cie.2011.06.002
  8. Trigeiro, W. W., Thomas, L. J., and McClain J. O.; "Capacitated lot sizing with setup times," Management Science, 35(3) : 353-366, 1989. https://doi.org/10.1287/mnsc.35.3.353
  9. Zhu, X. Y. and Wilhelm, W. E.; "Scheduling and lot sizing with sequence-dependent setup : a literature review," IIE Transactions, 31(11) : 987-1007, 2006.