Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
A new version of on-line variable-sized bin packing
Discrete Applied Mathematics
Approximation algorithms for time constrained scheduling
Information and Computation
Bounds on multiprocessing anomalies and related packing algorithms
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
SIAM Journal on Optimization
Parametric Packing of Selfish Items and the Subset Sum Algorithm
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Fast algorithms for bin packing
Journal of Computer and System Sciences
Scheduling Jobs on Grid Processors
Algorithmica
Worst-case analysis of the subset sum algorithm for bin packing
Operations Research Letters
| Hi-index | 0.00 |
We study a new kind of online bin packing with conflicts, motivated by a problem arising when scheduling jobs on the Grid. In this bin packing problem, the set of items is given at the beginning, together with a set of conflicts on pairs of items. A conflict on a pair of items implies that they cannot be assigned to a common bin. The online scenario is realized as follows. Variable-sized bins arrive one by one, and items need to be assigned to each bin before the next bin arrives. We analyze the online problem as well as semi-online versions of it, which are the variant where the sizes of the arriving bins are monotonically non-increasing as well as the variant where they are monotonically non-decreasing.