Management Science and Financial Engineering

  • 제19권1호
  • /
  • Pages.25-28
  • /
  • 2013
  • /
  • 2287-2043(pISSN)
  • /
  • 2287-2361(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지
DOI QR코드

DOI QR Code

Inverse Bin-Packing Number Problems: Polynomially Solvable Cases

  • 투고 : 2012.11.24
  • 심사 : 2012.12.02
  • 발행 : 2013.05.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Consider the inverse bin-packing number problem. Given a set of items and a prescribed number K of bins, the inverse bin-packing number problem, IBPN for short, is concerned with determining the minimum perturbation to the item-size vector so that all the items can be packed into K bins or less. It is known that this problem is NP-hard (Chung, 2012). In this paper, we investigate some special cases of IBPN that can be solved in polynomial time. We propose an optimal algorithm for solving the IBPN instances with two distinct item sizes and the instances with large items.

키워드

참고문헌

  1. Ausiello, G., P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccame-La, and M. Protasi, Complexity and approximation (Combinatorial optimization problems and their approximability properties), Springer, Berlin, 1999.
  2. Chung, Y., "Inverse bin-packing number problems: Hardness and approximation results," Management Science and Financial Engineering 18, 2 (2012), 1-4. https://doi.org/10.7737/MSFE.2012.18.2.001
  3. Chung, Y., J. F. Culus, and M. Demange, "Inverse booking problems," In Proceedings of the 2nd Work-shop on Algorithms and Computation, WALCOM Lecture Notes in Computer Science, 4921 (2008), 180-187.
  4. Chung, Y., S. Hong, and M. Park, "Inverse interval scheduling problems," Manuscript 2013.
  5. Garey, M. R. and D. S. Johnson, Computers and Intractability-A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
  6. Harvey, W., "Computing two-dimensional integer hulls," SIAM Journal on Computing 28, 6 (1999), 2285-2299. https://doi.org/10.1137/S009753979528977X
  7. Heuberger, C., "Inverse combinatorial optimization: A survey on problems, methods, and Results," Journal of Combinatorial Optimization 8, 3 (2004), 329-361. https://doi.org/10.1023/B:JOCO.0000038914.26975.9b
  8. McCormick, S. T., S. R. Smallwood, and F. C. R. Spieksma, "A polynomial algorithm for multiprocessor scheduling with two job lengths," Mathematics of Operations Research 26, 1 (2001), 31-49. https://doi.org/10.1287/moor.26.1.31.10590