Before revision:  We give a similar result when item size distributions are exponential with arbitrary rates  .
After revision:  We give a similar result when item size distributions are exponential with arbitrary rates . We also study the offline model, where distributions are known in advance but must be packed sequentially. We construct a soft-capacity PTAS for this problem, and show that the complexity of computing the optimal offline cost is \#\mathbf{P .