The scheduling problem of how to pack a number of boxes of different volumes into a finite number of identical bins using as few bins as possible. The problem has been shown to be NP-hard, which means that, if P ≠ NP, it cannot be solved in polynomial time.