A Single Machine Scheduling Problem with Random Processing Times
Naval Research Logistics
We consider the problem of scheduling n jobs with random processing times on a single machine in order to minimize the expected variance of the completion times. We prove a number of results, including one to the effect that the optimal schedule must be V shaped when the jobs have identical means or variances or have exponential processing times.
© 1986 Wiley Periodicals, Inc., A Wiley Company
Chakravarthy, Srinivas R., "A Single Machine Scheduling Problem with Random Processing Times" (1986). Industrial & Manufacturing Engineering Publications. 82.