Classical bin packing has been studied extensively in the literature. Open-ends bin packing is a variant of the classical bin packing. Open-ends bin packing allows pieces to be partially beyond a bin, while the classical bin packing requires all pieces to be completely inside a bin. We investigate the open-ends bin packing problem for both the off-line and on-line versions and give algorithms to solve the problem for parametric cases.