Scheduling jobs with random processing t
โ
X. Cai; F. S. Tu
๐
Article
๐
1996
๐
John Wiley and Sons
๐
English
โ 942 KB
We examine the problem of scheduling n jobs with a common due date on a single machine. The processing time ofeach job is a random variable, which follows an arbitrary distribution with a known mean and a known variance. The machine is not reliable; it is subject to stochastic breakdowns. The objec