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.
Results that may be inaccessible to you are currently showing.
Hide inaccessible results