Manufacturing is complicated. I’ve said that before, but it bears repeating. Aside from quality, supply chain, personnel, compliance, and hosts of other complexities, scheduling alone is complicated in the “almost impossible to get right” kind of way. Scheduling is a problem that a computer scientist would call “np-hard,” which literally means “non-deterministic polynomial-time hard.” That’s a mouthful, but more colloquially it means a computer could spend the age of the universe trying possibilities and not finish.

Continue Reading on The Fabricator