Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

A parallel approximation algorithm for solving one-dimensional bin packing problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Berkey, J.O. ; Dept. of Comput. Sci., George Mason Univ., Fairfax, VA, USA ; Wang, P.Y.

Describes a parallel approximation algorithm that can be used to obtain solutions to the one-dimensional bin packing problem: a list L of n items with sizes in the interval [0,1] is to be packed into a minimum number of unit-size bins. The algorithm is based on a systolic model of computation and packs items into one-dimensional bins by dividing L into ten subsets of pieces that are processed concurrently. It is shown that this algorithm has a worst case asymptotic error bound of 1.5 and a time complexity of Θ(n). The algorithm has also been implemented on an Inmos transputer array and execution results are reviewed to show how the method performs in practice

Published in:

Parallel Processing Symposium, 1991. Proceedings., Fifth International

Date of Conference:

30 Apr-2 May 1991