Consider n jobs and two machines. Each job has to be processed on both machines. The order in which it is done is immaterial. However, the decision maker has to decide in advance which jobs will be processed first on machine 1 (2). The paper assumes that processing times on each machine are identically exponentially distributed random variables. It proves that assigning equal number of jobs to be first processed by machine 1 (2) stochastically minimizes the makespan.
