BICRITERION STOCHASTIC SCHEDULING ON ONE OR MORE MACHINES

This paper is concerned with two types of bicriterion stochastic sched uling problems, the first involving a single machine, and the second i nvolving the m-machine flow shop. In both problem types, a set of n jo bs is to be processed on one or more machines, and the objective is to find a job sequence which minimizes the sum of the expected total wei ghted tardiness and the expected total weighted flowtime. The job proc essing times are independent random variables and the jobs have a comm on, random due date. For both problem types, an optimal job sequence i s obtained by processing the jobs in increasing stochastic order of th eir processing times.