A geometric model is given for the problem of scheduling N jobs on M machines so that the total time needed to complete the processing of all jobs is minimized. This model leads to a graphical ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback