Abstract

We address the problem to minimize the weighted sum of completion times in nonpreemptive
parallel machine scheduling. We consider the stochastic variant of this problem in which the
processing times are exponentially distributed random variables. We discuss the phenomenon
of deliberate idleness. For some cases we prove that optimal policies are idle time
... read more