Scheduling jobs with exponential processing times on parallel machines

Publisher Website
Google Scholar
Abstract
We consider a system where jobs are processed by parallel machines. The processing times are exponentially distributed. An essential feature is that the assignment of the jobs to the machines is decided before the system starts to work. We consider both the flow time and the makespan. In the case of the flow time we allow both the machines and the jobs to be non-homogeneous. The optimization is by minimizing the flow time in the sense of stochastic order and the optimal assignment is obtained for this case. The case of the makespan is harder. We consider the expected makespan and as a partial solution we prove an optimality result for the case where there are two non-homogeneous machines and the jobs are homogeneous. It turns out that the optimal assignment can be expressed by using a quantile of a binomial distribution.