A single-machine scheduling problem with random processing times |
| |
Authors: | S. Chakravarthy |
| |
Abstract: | 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. |
| |
Keywords: | |
|
|