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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
