Title of article
A new version of on-line variable-sized bin packing Original Research Article
Author/Authors
Guochuan Zhang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
5
From page
193
To page
197
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.
Keywords
Bin packing , On-line algorithm , Worst-case analysis
Journal title
Discrete Applied Mathematics
Serial Year
1996
Journal title
Discrete Applied Mathematics
Record number
884474
Link To Document