산업경영시스템학회지 (Journal of Korean Society of Industrial and Systems Engineering)

  • 제32권3호
  • /
  • Pages.29-39
  • /
  • 2009
  • /
  • 2005-0461(pISSN)
  • /
  • 2287-7975(eISSN)
한국산업경영시스템학회 (Society of Korea Industrial and System Engineering)
권호 표지

GRASP 기법을 이용한 주문이월과 자원제약을 고려한 공급사슬 망에서의 생산계획 알고리즘

A Production Planning Algorithm for a Supply Chain Network Considering Bark-Order and Resource Capacity Using GRASP Method

  • 신현준 (상명대학교 경영공학과) ;
  • 이영섭 (상명대학교 경영공학과)
  • Shin, Hyun-Joon (Department of Management Engineering, Sangmyung University) ;
  • Lee, Young-Sup (Department of Management Engineering, Sangmyung University)
  • 발행 : 2009.09.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In an environment of global competition, the success of a manufacturing corporation is directly related to how it plans and executes production in particular as well as to the optimization level of its process in general. This paper proposes a production planning algorithm for the Multi-Level, multi-item Capacitated Lot Sizing Problem (MLCLSP) in supply chain network considering back-order. MLCLSP corresponds to a mixed integer programming (MIP) problem and is NP-hard. Therefore, this paper proposes an effective algorithm, GRHS (GRASP-based Rolling Horizon Search) that solves this problem within reasonable computational time and evaluates its performance under a variety of problem scenarios.

키워드

참고문헌

  1. Aiex, R. M, Resende, M G. C., and Ribeiro, C. C.; "Probability distribution of solution time in GRASP: An experimental investigation," Journal of Heuristics, 8 : 343-373, 2002 https://doi.org/10.1023/A:1015061802659
  2. Almeder, C.; "A hybrid optimization approach for multilevel capacitated lot-sizing problems," European Journal of Operational Research, 2009, In press
  3. Akartunali, K. and Miller, A.; "A heuristic approach for big bucket multi-level production planning problems," European Journal of Operational Research, 193 : 394-411, 2009 https://doi.org/10.1016/j.ejor.2007.11.033
  4. Bahl, H. C. and Ritzman, L. P.; "An Integrated Model for Master Scheduling, Lot Sizing and Capacity Requirements Planning," Journal of the Operational Research Society, 35 : 389-399, 1984 https://doi.org/10.1057/jors.1984.79
  5. Bahl, H. C., Ritzman, L. P., and Gupta, J. N. D.; "Determining Lot Sizes and Resource Requirement: a Review," Operations Research, 35 : 329-345, 1987 https://doi.org/10.1287/opre.35.3.329
  6. Drexl, A. and Haase, K.; "Proportional lot sizing and scheduling," International Journal of Production Economics, 40 : 73-87, 1995 https://doi.org/10.1016/0925-5273(95)00040-U
  7. Eppen, G. D. and Martin, R. K.; "Solving multi-item capacitated lot-sizing problems using variable redefinition," Operations Research, 35 : 832-848, 1987 https://doi.org/10.1287/opre.35.6.832
  8. Ertogral, K. and Wu, S. D.; "Auction-theoretic coordination of production planning in the supply chain," IIE Transactions, 32 : 931-940, 2000 https://doi.org/10.1080/07408170008967451
  9. Feo, T. A. and Resende, M. G. C.; "Greedy randomized adaptive search procedures," Journal of Global Optimization, 6 : 109-133, 1995 https://doi.org/10.1007/BF01096763
  10. Fleischmann, B.; "The discrete lot-sizing and scheduling problem," European Journal of Operational Research, 44 : 337-348, 1990 https://doi.org/10.1016/0377-2217(90)90245-7
  11. Florian, M., Lenstra, J. K., and Rinnooy Kan, A. H. G.; "Deterministic Production Planning Algorithms and Complexity," Management Science, 26 : 669-679, 1980 https://doi.org/10.1287/mnsc.26.7.669
  12. Hung, Y. F. and Chien, K. L.; "A Multi-Class Multi-Level Capacitated Lot Sizing Model," Journal of the Operational Research Society, 51(11) : 1309-1318, 2000 https://doi.org/10.1057/palgrave.jors.2601026
  13. Hung, Y. F. and Hu, Y. C,; "Solving Mixed Integer Programming Production Planning Problems with Setups by Shadow Price Information," Computers and Operations Research, 25 : 1027-1042, 1998 https://doi.org/10.1016/S0305-0548(98)00037-9
  14. Jayaraman, V. and Ross, A.; "A Simulated Annealing Methodology to Distribution Network Design and Management," European Journal of Operational Research, 144 : 629-645, 2003 https://doi.org/10.1016/S0377-2217(02)00153-4
  15. Karmarkar, U. and Schrage, L.; "The deterministic dynamic product cycling problem," Operations Research, 33 : 326-345, 1985 https://doi.org/10.1287/opre.33.2.326
  16. Kimms, A.; "Competitive Methods for Multi-level Lot Sizing and Scheduling : Tabu search and Randomized Regrets," International Journal of Production Research, 34(8) : 2279-2298, 1996 https://doi.org/10.1080/00207549608905025
  17. Kimms, A.; "A genetic algorithm for multi-level, multi-machine lot sizing and scheduling," Computers and Operations Research, 26(8) : 829-848, 1999 https://doi.org/10.1016/S0305-0548(98)00089-6
  18. Kuik, R. and Salomon, M.; "Batching Decisions: Structure and Models," European Journal of Operational Research, 75 : 243-260, 1994 https://doi.org/10.1016/0377-2217(94)90072-8
  19. Kuik, R., Salomon, M. Van Wassenhove, L. N., and Maes, J.; "Linear Programming, Simulated Annealing and Tabu Search Heuristics for Lotsizing in Bottleneck Assembly Systems," IIE Transactions, 25(1) : 62-72, 1993 https://doi.org/10.1080/07408179308964266
  20. Meas, J., McClain, J. O., and Van Wassenhove, L. N.; "Mutilevel Capacitated Lotsizing Complexity and LP-based Heuristics," European Journal of Operational Research, 53 : 131-148, 1991 https://doi.org/10.1016/0377-2217(91)90130-N
  21. Rojanasoonthon, S. and Bard, J.; "A GRASP for parallel machine scheduling with time windows," INFORMS Journal on Computing, 13(1) : 32-51, 2005 https://doi.org/10.1287/ijoc.1030.0048
  22. Ross, A. D.; A Two-Phsed Approach to the Supply Network Reconfiguration Problem. European Journal of Operational Research, 122 : 18-30, 2000 https://doi.org/10.1016/S0377-2217(99)00063-6
  23. Roundy, R. O.; "Efficient, Effective Lot Sizing for Multi stage Production Systems," Operations Research, 41 : 371-385, 1993 https://doi.org/10.1287/opre.41.2.371
  24. Sahling, F., Buschkuhl, L., Tempelmeier, H., and Helber, S.; "Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and -optimize heuristic," Computers and Operations Research, 36 : 2546-2553, 2009 https://doi.org/10.1016/j.cor.2008.10.009
  25. Stadtler, H.; "Mixed Integer Programming Model Formulations for Dynamic Multi-Item, Multi-Level Capacitated Lotsizing," European Journal of Operational Research, 94 : 561-581, 1996 https://doi.org/10.1016/0377-2217(95)00094-1
  26. Stadtler, H.; "Improved rolling scheduling for the dynamic single-level lot-sizing problem," Management Science, 46(2) : 318-326, 2000 https://doi.org/10.1287/mnsc.46.2.318.11924
  27. Tempelmeier, H, and Derstroff, M.; "A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times," Management Science, 425 : 738-757, 1996 https://doi.org/10.1287/mnsc.42.5.738
  28. Tempelmeier, H. and Helber, S.; "A Heuristic for Dynamic Multi-Item Multi-Level Capacitated Lotsizing for General Product Structures," European Journal of Operational Research, 75 : 296-311, 1994 https://doi.org/10.1016/0377-2217(94)90076-0
  29. Trigeiro, W. W., Thomas, L. J. and McClain, J. O.; "Capacitated lot-sizing with setup times," Management Science, 35 : 353-366, 1989 https://doi.org/10.1287/mnsc.35.3.353
  30. Vergana, F, E., Khouja, M., and Michalewicz, Z.; "An Evolutionary Algorithm for Optimizing Material Flow in Supply Chain," Computers and Industrial Engineering, 43 : 407-421, 2002 https://doi.org/10.1016/S0360-8352(02)00055-4