Online variable-sized bin packing
β Scribed by Nancy G. Kinnerseley; Michael A. Langston
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 438 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
## Abstract In many applications of packing, the location of small items below large items, inside the packed boxes, is forbidden. We consider a variant of the classic online oneβdimensional bin packing, in which items allocated to each bin are packed there in the order of arrival, satisfying the c