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.

This is a preview. Log in through your library . Abstract We consider n jobs to be scheduled on two parallel machines. The jobs are subject to intree precedence constraints, that is, each job, except ...