摘要
We consider preemptive scheduling on parallel machines where the number ofavailable machines may be an arbitrary, possibly random, function of time. Processingtimes of jobs are from a family of DLR (decreasing likelihood ratio) distributions, andjobs may arrive at random agreeable times. We give a constructive coupling proof toshow that LEPT stochastically minimizes the makespan, and that it minimiz