| Tekijä: | Harrison, J. M. Wein, L. M. |
| Otsikko: | Scheduling networks of queues: heavy traffic analysis of a two-station closed network. |
| Lehti: | Operations Research
1990 : NOV-DEC, VOL. 38:6, p. 1052-1064 |
| Asiasana: | QUEUING THEORY NETWORKS SCHEDULING |
| Kieli: | eng |
| Tiivistelmä: | A multiclass closed queueing network with two single-server stations is considered. Each class requires service at a particular station, and customers change class after service according to specified probabilities. There is a general service time distribution for each class. The problem is to schedule the two servers to maximize the long-run average throughput of the network. By assuming a large customer population and nearly balanced loading of the two stations, the scheduling problem can be approximated by a dynamic control problem involving Brownian motion. A reformulation of this control problem is solved exactly and the solution is interpreted in terms of queueing network to obtain a scheduling rule. |
SCIMA