Korean Management Science Review (경영과학)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지
DOI QR코드

DOI QR Code

A Study on Heat-Treatment Process Scheduling for Heavy Forged Products using MIP

열처리 공정의 생산스케줄 수립과 적용에 관한 연구

  • Received : 2012.06.14
  • Accepted : 2012.07.10
  • Published : 2012.07.31
Download PDF
⟨ Previous Next ⟩

Abstract

The purpose of this study is to formulate and solve the scheduling problem to heat-treatment process in forging process and apply it to industries. Heat-treatment is a common process in manufacturing heavy forged products in ship engines and wind power generators. Total complete time of the schedule depends on how to group parts and assign them into heat furnace. Efficient operation of heat-treatment process increases the productivity of whole production system while scheduling the parts into heat-treatment furnace is a combinatorial problem which is known as an NP-hard problem. So the scheduling, on manufacturing site, relies on engineers' experience. To improve heat-treatment process schedule, this study formulated it into an MIP mathematical model which minimizes total complete time. Three methods were applied to example problems and the results were compared to each other. In case of small problems, optimal solutions were easily found. In case of big problems, feasible solutions were found and that feasible solutions were very close to lower bound of the solutions. ILOG OPL Studio 5.5 was used in this study.

Keywords

References

  1. 박상혁, 장수영, "후판 날판설계를 위한 이차원 빈패킹 최적화 기법", 대한산업공학회/한국경영과학회 춘계공동학술대회논문집, 2006, pp.1-6.
  2. 안혜환, 윤희용, 손재기, 전기만, 양만석, "Bin-Packing과 DRR을 이용한 블루투스 MAC 계층에서의 효과적인 패킷 스케줄링", 한국정보과학회 봄 학술발표논문집, 제30권, 제1호 (2003), pp.451-453.
  3. 이영덕, "컨테이너 빈패킹문제의 사례연구", 경영학연구논문집, 제10권, 제1호(2003), pp.17-25.
  4. Arthur, L.C. and L.W. Roger, "A Heuristic for Improved Genetic Bin Packing," Information Processing Letters, 1993.
  5. Eilon, S. and N. Christofides, "The loading problem," Management Science, Vol.17(1971), pp.259-268. https://doi.org/10.1287/mnsc.17.5.259
  6. Gupta, N., D. Jatinder, and C.H. Johnny, "A new heuristic algorithm for the one-dimensional bin-packing problem," Prodution Planning and Control, Vol.10, No.6(1999), pp.598-603. https://doi.org/10.1080/095372899232894
  7. Johnson, D.S., A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham, "Worst-case performance bounds for simple one-dimensional packing algorithm," SIAM Journal of Computing, Vol.3(1974), pp.299-326. https://doi.org/10.1137/0203025
  8. Monaci, Michele, and Paolo Toth, "A Set-Covering-Based Heuristic Approach for Bin-Packing Problems," INFORMS Journal on Computing, Vol.18, No.1(2006), pp.71-85. https://doi.org/10.1287/ijoc.1040.0089
  9. Sami Khuri, and Martin Schutz, "Evolutionary Heuristics for the Bin Packing Problem," The ICANNGA, Springer-Verlag, Vienna (1994), pp.285-288.
  10. Spieksma, F.C.R., "A branch-and-bound algorithm for the two-dimensional vector packing problem," Comput. Oper. Res., Vol.21(1994), pp.19-25. https://doi.org/10.1016/0305-0548(94)90059-0