haku: @author Pinedo, M. / yhteensä: 11
viite: 3 / 11
| Tekijä: | Pinedo, M. Weiss, G. |
| Otsikko: | The "largest variance first" policy in some stochastic scheduling problems. |
| Lehti: | Operations Research
1987 : NOV-DEC, VOL. 35:6, p. 884-891 |
| Asiasana: | PRODUCTION SCHEDULING STOCHASTIC PROCESSES |
| Kieli: | eng |
| Tiivistelmä: | The following representative situation is considered: a batch of jobs of several types, all with equal mean processing times but with different, random variances, are to be scheduled on several parallel machines. In this situation, the rule that says to schedule the jobs with largest variance first is intuitively appealing for two reasons: it tends to produce jobs with very early completions at the start of the shedule, and it assures that jobs at the end of the schedule are less variable and hence more predictable. The former effect is favorable for minimizing flow-time, the latter for minimizing makespan. It is shown that the largest variance first policy does indeed minimize both under specific assumptions. |
SCIMA