Just because a problem is NP-complete doesn't mean it's infeasible to produce "good enough" approximate solutions. The traveling salesman problem is a great example of this.

Apologies, my OCD was showing.

It’s an interesting problem to pack the dishwasher with as many objects as possible and maintain the highest level of cleanliness. Sometimes, there’s an small thing leftover so then repack in a different configuration.