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.

Your problem then becomes deriving a valid serialized schedule for such a system at a specified loading, which you express as a set of system parameters, such as the number of active channels or the ...

We consider generalisations of two classical stochastic scheduling models, namely the discounted branching bandit and the discounted multi-armed bandit, to the case where the collection of machines ...