Scheduling identical jobs on uniform parallel machines with random processing times

For the problem of scheduling identical jobs on a set of uniform parallel machines with random processing times, methods are given for optimizing the expected sum of weighted completion times and the probability of meeting a common due date.