A tight lower bound for optimal bin packing

Authors:
Heng-Yi Chao;Mary P. Harper;Russell W. Quong
Affiliations:
School of Electrical and Computer Engineering, 1285 Electrical Engineering Building, Purdue University, West Lafayette, IN 47907-1285, USA;School of Electrical and Computer Engineering, 1285 Electrical Engineering Building, Purdue University, West Lafayette, IN 47907-1285, USA;School of Electrical and Computer Engineering, 1285 Electrical Engineering Building, Purdue University, West Lafayette, IN 47907-1285, USA
Venue:
Operations Research Letters
Year:
1995

Citing 6
Cited 2

A simple on-line bin-packing algorithm

Journal of the ACM (JACM)
New Algorithms for Bin Packing

Journal of the ACM (JACM)
Graph Theory With Applications

Graph Theory With Applications
Bin packing with items uniformly distributed over intervals [a,b]

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
The Average-Case Analysis of Some On-Line Algorithms for Bin Packing

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Fast algorithms for bin packing

Journal of Computer and System Sciences

New bin packing fast lower bounds

Computers and Operations Research
Note: A note on minimizing makespan on a single batch processing machine with nonidentical job sizes

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an O(n log n) algorithm to compute a tight lower bound for the one-dimensional bin packing problem. We have simulated the algorithm on randomly generated bin packing problems with item sizes drawn uniformly from (a, b), where 0 == B, the error is less than 0.003%.