Scheduling by Michael L. Pinedo

Author:Michael L. Pinedo
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

(b)Show that the probability that the random variable D assumes the value 1 is equal to the probability that the sum of the n processing times is odd and therefore independent of the schedule.

(c)Show that minimizing the expected makespan is equivalent to minimizing P(D = 2) and maximizing P(D = 0).

(d)Find the optimal sequence.

12.18.Consider two machines in parallel and n jobs. The processing time of job j is zero with probability p 0j , 1 with probability p 1j , and 2 with probability Show through a counterexample that the Largest Variance first (LV) rule is not necessarily optimal.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.