Before revision:  When the ratio between the maximum capacity and the minimum capacity of the bins is bounded by a constant , we provide a (1/2-\epsilon)-approximation algorithm which is also combinatorial and deterministic.
After revision:  In the general case , we provide a (1/2-\epsilon)-approximation algorithm which is also combinatorial and deterministic.