Originally Posted by RGS5526

Scheduling is a variation of the "Knapsack" or "machine loading" problem, rather than the "travelling salesman", but both are classed as "hard" computational problems with no easy general solution. Brute force (and perhaps a bit of experience) is needed in general, although a solution somewhere near the best can often be found in less than polynomial time.