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

  • 제38권1호
  • /
  • Pages.1-6
  • /
  • 2012
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지
DOI QR코드

DOI QR Code

큰 사이즈 아이템들에 대한 2차원 벡터 패킹문제의 어려움

Hardness of Approximation for Two-Dimensional Vector Packing Problem with Large Items

  • 황학진 (조선대학교 공과대학 산업공학과) ;
  • 강장하 (조선대학교 공과대학 산업공학과)
  • Hwang, Hark-Chin (Department of Industrial Engineering, Chosun University) ;
  • Kang, Jang-Ha (Department of Industrial Engineering, Chosun University)
  • 투고 : 2011.04.25
  • 심사 : 2011.11.09
  • 발행 : 2012.03.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

We consider a two-dimensional vector packing problem in which each item has size in x- and y-coordinates. The purpose of this paper is to provide a ground work on how hard two-dimensional vector packing problems are for large items. We prove that the problem with each item greater than 1/2-${\varepsilon}$ either in x- or y-coordinates for 0 < ${\varepsilon}$ ${\leq}$ 1/6 has no APTAS unless P = NP.

키워드

참고문헌

  1. Arora, S., Lund, C., Motwani, R., Sudan, M., and Szegedy, M. (1992), Proof verification and hardness of approximation problems, in Proceedings of the 33rd IEEE Symposium on the Foundations of Computer Science, 14-23.
  2. Caprara, A. and Toth, P. (2001), Lower bounds and algorithms for the 2-dimensional vector packing problem, Discrete Applied Mathematics, 111, 231-262. https://doi.org/10.1016/S0166-218X(00)00267-5
  3. Chang, S. Y., Hwang, H.-C., and Park, S. (2005), A two-dimensional vector packing model for the efficient use of coil cassettes, Computers and Operations Research, 32, 2051-2058. https://doi.org/10.1016/j.cor.2004.01.006
  4. Chekuri, C. (1998), Approximation Algorithms for Scheduling Problems, PhD. Thesis, Stanford University, Department of Computer Science.
  5. Coffman Jr., E. G., Garey, M. R., and Johnson D. S. (1997), Approximation algorithms for bin packing: A survey, in D. S. Hochbaum, eds. : Approximation Algorithms for NPhard Problems, PWS Publishing Company.
  6. Fernandez de la Vega, W. and Lueker, G. S. (1981), Bin packing can be solved within $1+{\epsilon}$ in linear time, Combinatorics, 1, 349-355. https://doi.org/10.1007/BF02579456
  7. Garey, M. R. and Johnson, D. S. (1979), Computers and Intractability : a Guide to the Theory of NP-Completeness, Freeman, San Francisco.
  8. Hwang, H.-C. (2007), A 4/3-Approximation Algorithm for Cassette Packing in Steel Industry, Asia-Pacific Journal of Operational Research, 24, 715-724. https://doi.org/10.1142/S0217595907001462
  9. Johnson, D. S. (1973), Near-Optimal Bin Packing Algorithms, PhD thesis, Massachusetts Institute of Technology, Department of Mathematics, Cambridge, MA.
  10. Kann, V. (1991), Maximum bounded 3-dimensional matching is MAX SNP-complete, Information Processing Letters, 38, 27-35.
  11. Kellerer, H. and Kotov, V. (2003), An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing, Operations Research Letters, 31, 35- 41. https://doi.org/10.1016/S0167-6377(02)00173-6
  12. Papadimitriou, C. H. and Yannakakis, M. (1991), Optimization, approximation and complexity classes, Journal of Computer and System Sciences, 43, 425-440. https://doi.org/10.1016/0022-0000(91)90023-X
  13. Spieksma, F. C. R. (1994), A branch-and-bound algorithm for the two dimensional vector packing problem, Computers and Operations Research, 21, 19-25. https://doi.org/10.1016/0305-0548(94)90059-0
  14. Woeginger, G. J. (1997), There is no asymptotic PTAS for two-dimensional vector packing, Information Processing Letters, 64, 293-297. https://doi.org/10.1016/S0020-0190(97)00179-8
  15. Yao, A. C. C. (1980), New algorithms for bin packing, Journal of the ACM, 27, 207-227. https://doi.org/10.1145/322186.322187