We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . . , sn ∈ [0, 1] and a conflict graph G = (V, E), the goal is to find a partition of the items into independent sets of G, where the total size of each independent set is at most one, so that the number of independent sets in the...

Motivated by bursty bandwidth allocation and the of virtual machines to servers in cloud, we consider online problem packing items with random sizes into unit-capacity bins. Items arrive sequentially, but on arrival, an item’s actual size is unknown; only its probabilistic information available decision maker. Without knowing this size, maker must irrevocably pack item bin or place it a new bin...

The study documented three-dimensional spinal loading during lifting from an industrial bin. Two lifting styles and two bin design factors were examined in Phase I. The lifting style measures in Phase I were one hand versus two hand and standing on one foot versus two feet. The bin design variables were region of load in the bin and bin height. The Phase II study examined one-handed lifting sty...

Objects of various integer sizes, o,, o , are to be packed together into bins of size N as they arrive at a service facility. The number of objects of size o, which arrive by time t is A , where the components of A' = (A , * , A ')' are independent renewal processes, with A'/t A as t --oo. The empty space in those bins which are neither empty nor full at time t is called the wasted space and th...

We give a (1 − 1/e)-approximation algorithm for the Max-Profit Generalized Assignment Problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every item is independent from the bin it is assigned to. The previously best known approximation ratio for this problem was 1/2. Key-words. Generalized assignment, Approximation algorithm.

We consider colorful bin packing games in which selfish players control a set of items which are to be packed into a minimum number of unit capacity bins. Each item has one of m ≥ 2 colors and cannot be packed next to an item of the same color. All bins have the same unitary cost which is shared among the items it contains, so that players are interested in selecting a bin of minimum shared cos...

Adult insects entering 34 bins (36-238 t capacity) storing newly harvested hard red winter wheat on 12 farms in Kansas were sampled from July through December 1998 using ventilation traps. Insects moving through the grain stored in these bins were sampled using probe traps. During the fourth week of storage, probe traps captured Cryptolestes ferrugineus in all bins, Ahasverus advena in 32 bins,...

Standard bin packing is the problem of partitioning a set of items with positive sizes no larger than 1 into a minimum number of subsets (called bins) each having a total size of at most 1. In bin packing games, an item has a positive weight, and given a valid packing or partition of the items, each item has a cost or a payoff associated with it. We study a class of bin packing games where the ...