Affiliation:
1. Northwestern Univ., Evanston, IL
Abstract
The one-dimensional on-line bin-packing problem is considered, A simple
O
(1)-space and
O
(
n
)-time algorithm, called HARMONIC
M
, is presented. It is shown that this algorithm can achieve a worst-case performance ratio of less than 1.692, which is better than that of the
O
(
n
)-space and
O
(
n
log
n
)-time algorithm FIRST FIT. Also shown is that 1.691 … is a lower bound for
all
0
(1)-space on-line bin-packing algorithms. Finally a revised version of HARMONIC
M
, an
O
(
n
)-space and
O
(
n
)- time algorithm, is presented and is shown to have a worst-case performance ratio of less than 1.636.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference11 articles.
1. BROWN D.J.A lower bound for on-line one-dimensional bin packing algorithms. Tech. Rep. No. R-864 Coordinated Sci. Lab. Univ. of Illinois Urbana I11. 1979. BROWN D.J.A lower bound for on-line one-dimensional bin packing algorithms. Tech. Rep. No. R-864 Coordinated Sci. Lab. Univ. of Illinois Urbana I11. 1979.
2. COFFMAN E.G. jR. GAREY M.R. AND JOHNSON D.S. Approximation algorithms for binpackingmAn updated survey. Bell Laboratories Murray Hill N.J. Oct. I983. COFFMAN E.G. jR. GAREY M.R. AND JOHNSON D.S. Approximation algorithms for binpackingmAn updated survey. Bell Laboratories Murray Hill N.J. Oct. I983.
Cited by
255 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献