𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parameterized on-line open-end bin packing

✍ Scribed by Guochuan Zhang

Book ID
110625330
Publisher
Springer Vienna
Year
1998
Tongue
English
Weight
303 KB
Volume
60
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on an open-end bin packing proble
A note on an open-end bin packing problem
✍ Joseph Y.-T. Leung; Moshe Dror; Gilbert H. Young πŸ“‚ Article πŸ“… 2001 πŸ› Springer US 🌐 English βš– 71 KB πŸ‘ 1 views

We consider a variant of the classical one-dimensional bin packing problem, which we call the open-end bin packing problem. Suppose that we are given a list L = (p 1 ; p 2 ; : : : ; pn) of n pieces, where p j denotes both the name and the size of the jth piece in L, and an inΓΏnite collection of inΓΏn

A new version of on-line variable-sized
A new version of on-line variable-sized bin packing
✍ Guochuan Zhang πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 304 KB

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