A few days ago I asked this question. It turned out to be a known unsolved problem in mathematics: The Kelvin problem.
Now I'd like to slightly change the question:
What is the optimal way to divide 3-space into pieces of equal volume with the least total surface area, whereby only isohedral polyhedra are allowed?
I hope, this will be easier to solve than the original Kelvin problem.