We study the problem of scheduling a set of J jobs on M machines with stochastic job processing times when no preemptions are allowed and with a weighted sum of expected completion times objective.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results