论文信息 - A New Version of On-line Variable-sized Bin Packing

A New Version of On-line Variable-sized Bin Packing

Abstract This paper investigates a new version of the on-line variable-sized bin packing problem. Suppose that bin capacities can vary. Given a list of items, the goal is to pack items in the bins which arrive in an on-line way such that the total size of bins used is minimized. It is shown that next fit and first fit (decreasing) algorithms all have a worst-case performance bound of 2.

Guochuan Zhang | Guochuan Zhang

[1] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .

[2] Gerhard J. Woeginger,et al. On-line bin packing — A restricted survey , 1995, Math. Methods Oper. Res..

[3] Giorgio Ausiello,et al. Analysis and design of algorithms in combinatorial optimization , 1981 .

[4] Edward G. Coffman,et al. A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing , 1981 .

[5] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[6] Michael A. Langston,et al. Online variable-sized bin packing , 1989, Discret. Appl. Math..