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

  • 제34권4호
  • /
  • Pages.470-480
  • /
  • 2008
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

철강 코일제품 수송 팔레트의 설계 최적화

On Optimal Design Methods for Steel Product Pallets

  • 박종호 (포항공과대학교 산업경영공학과) ;
  • 임경국 (포항공과대학교 산업경영공학과) ;
  • 이정원 (포항공과대학교 산업경영공학과)
  • Park, Jong-Ho (Department of Industrial and Management Engineering, POSTECH) ;
  • Lim, Kyung-Kuk (Department of Industrial and Management Engineering, POSTECH) ;
  • Lee, Jeong-Won (Department of Industrial and Management Engineering, POSTECH)
  • 투고 : 2008.08.28
  • 심사 : 2008.10.12
  • 발행 : 2008.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Loading steel coil products on a specialized packing case called pallet can be represented as a bin-packing problem with the special constraint where objects should be loaded on designated positions of bins. In this paper, under assuming that there exist only two types of objects, we focus on finding the optimum number of positions in a bin which minimizes the number of bins needed for packing a collection of objects. Firstly, we propose a method to decide the number of positions and prove that the method is optimum. Finally, for the packing problem using bins designed by the method, we show that the well-known algorithm, First-Fit Decreasing(FFD), is the optimum algorithm.

키워드

과제정보

연구 과제번호 : 3차년도 미래형 기계 국고지원금

연구 과제 주관 기관 : 4.0002619.02

참고문헌

  1. Baker, B. S. (1983), A New Proof for the First-Fit Decreasing Bin-Packing Algorithm, Technical Memorandum, Bell Laboratories, Murray Hill, NJ 07974
  2. Coffman, E. G., Garey, M. R., and Johnson, D. S. (1983), Approximation Algorithms for Bin-Packing-An Updated Survey, Bell Laboratories, Murray Hill, NJ, 49-106
  3. Coffman, E. G., Garey, M. R., and Johnson, D. S. (1996), Approximation Algorithm for Bin-Packing : A Survey, Approximation Algorithms for NP-Hard Problem, D. Hochbaum, PWS Publishing, Boston, 46-93
  4. Graham, R. L. (1969), Bounds on Multiprocessing Timing Anomalies, SIAM Journal Appl. Math., 17(2)
  5. Johnson, D. S. (1973), Near-Optimal Bin Packing Algorithms, Technical Report MACTR-109, Project MAC, Massachusetts Institute of Technology, Cambridge, Mass
  6. Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., and Graham, R. L. (1974), Worst-Case Performance Bound for Simple One-Dimensional Packing Algorithms, SIAM Journal of Computing, 3(4), 299-326 https://doi.org/10.1137/0203025