대한산업공학회지 (Journal of Korean Institute of Industrial Engineers)

  • 제33권3호
  • /
  • Pages.373-380
  • /
  • 2007
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

로트 크기 결정 문제의 새로운 혼합정수계획법 모형 및 휴리스틱 알고리즘 개발

An Alternative Modeling for Lot-sizing and Scheduling Problem with a Decomposition Based Heuristic Algorithm

  • 한정희 (강원대학교 경영학과) ;
  • 이영호 (고려대학교 정보경영공학전문대학원) ;
  • 김성인 (고려대학교 정보경영공학전문대학원) ;
  • 박은경 (고려대학교 정보경영공학전문대학원)
  • Han, Junghee (College of Business Administration, Kangwon National Univeristy) ;
  • Lee, Youngho (Division of Information Management Engineering, College of Engineering, Korea University) ;
  • Kim, Seong-in (Division of Information Management Engineering, College of Engineering, Korea University) ;
  • Park, Eunkyung (Division of Information Management Engineering, College of Engineering, Korea University)
  • 발행 : 2007.09.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost and inventory cost. Setup carry-over and overlapping as well as demand splitting are considered. Also, maximum number of setups for each time period is not limited. For this LSSP, we have formulated a mixed integer programming (MIP) model, of which the size does not increase even if we divide a time period into a number of micro time periods. Also, we have developed an efficient heuristic algorithm by combining decomposition scheme with local search procedure. Test results show that the developed heuristic algorithm finds good quality (in practice, even better) feasible solutions using far less computation time compared with the CPLEX, a competitive MIP solver.

키워드

참고문헌

  1. Boctor, F. F. and Poulin, P. (2005), Heuristics for the N-product, M-stage, economic lot sizing and scheduling problem with dynamic demand, International Journal of Production Research, 43(10),2809-2828 https://doi.org/10.1080/00207540500057589
  2. Clark, A. R. and Clark, S. J. (2000), Rolling-horizon lot-sizing when set-up times are sequence-dependent, International Journal of Production Research, 38(10),2287-2307 https://doi.org/10.1080/00207540050028106
  3. Drexl, A. and Haase, K. (1995), Proportional lotsizing and scheduling, International Journal of Production Economics, 40(1),73-87 https://doi.org/10.1016/0925-5273(95)00040-U
  4. Drexl, A. and Haase, K. (1996), Sequential-analysis based randomized-regret-methods for lot- sizing and scheduling, Journal of the Operational Research Society, 47(2), 251-265 https://doi.org/10.1057/jors.1996.23
  5. Gopalakrishnan, M. (2000), A modified framework for modeling set-up carryover in the capacitated lotsizing problem, International Journal of Production Research, 38(14), 3421-3424 https://doi.org/10.1080/002075400418324
  6. Gupta, D. and Magnusson, T. (2005), The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times, Computers & Operations Research, 32(4), 727-747 https://doi.org/10.1016/j.cor.2003.08.014
  7. Fleischmann, B. and Meyr, H. (1997), The general lotsizing and scheduling problem, OR Spektrum, 19, 11-21 https://doi.org/10.1007/BF01539800
  8. Marinelli, F., Nenni, M. E. and Sforza, A. (2007), Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company, Annals of Operations Research, 150(1),177-192 https://doi.org/10.1007/s10479-006-0157-x
  9. Meyr, H. (2000), Simultaneous lotsizing and scheduling by combining local search with dual reoptimization, European Journal of Operational Research, 120(2), 311-326 https://doi.org/10.1016/S0377-2217(99)00159-9
  10. Meyr, H. (2002), Simultaneous lotsizing and scheduling on parallel machines, European Journal of Operational Research, 139(2), 277-292 https://doi.org/10.1016/S0377-2217(01)00373-3
  11. Pattloch, M., Schmidt, G. and Kovalyov, M. Y. (2001), Heuristic algorithms for lotsize scheduling with application in the tobacco industry, Computers and Industrial Engineering, 39(3), 235-253 https://doi.org/10.1016/S0360-8352(01)00004-3
  12. Porkka, P., Vepsalainen, A. P. and Kuula, M. (2003), Multiperiod production planning carrying over set-up time, International Journal of Production Research, 41(6), 1133-1148 https://doi.org/10.1080/0020754021000042995
  13. Silva, C. and Magalhaes, J. M. (2006), Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry, Computers and Industrial Engineering, 50(1),76-89 https://doi.org/10.1016/j.cie.2006.01.001
  14. Sox, C. R. and Gao, Y. (1999), The capacitated lot sizing problem with setup carry-over, lIE Transactions, 31(2), 173-181
  15. Staggemeier, A. T. and Clark, A. R. (2001), A survey of lot-sizing and scheduling models, 23rd Annual Symposium of the Brazilian Operational Research Society, 938-947
  16. Suerie, C. and Stadtler, H. (2003), The capacitated lot-sizing problem with linked lot sizes, Management Science, 49(8), 1039-1054 https://doi.org/10.1287/mnsc.49.8.1039.16406
  17. Suerie, C. (2006), Modeling of period overlapping setup times, European Journal of Operational Research, 174(2), 874-886 https://doi.org/10.1016/j.ejor.2005.03.033
  18. Zanoni, S. and Zavanella, L. (2005), Model and analysis of integrated production-inventory system: The case of steel production, International Journal of Production Economics, 93(94), 197-205 https://doi.org/10.1016/j.ijpe.2004.06.018