We analyze a class of stochastic and dynamic vehicle routing problems in which demands arrive randomly over time and the objective is minimizing waiting time. In our previous work ([6], [7]), we ...

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.