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 Naval Research Logistics
Chakravarthy, Srinivas R., "A single‐machine scheduling problem with random processing times" (1986). Industrial & Manufacturing Engineering Presentations And Conference Materials. 45.