Article ID: | iaor1993807 |
Country: | Netherlands |
Volume: | 11 |
Issue: | 4 |
Start Page Number: | 225 |
End Page Number: | 232 |
Publication Date: | May 1992 |
Journal: | Operations Research Letters |
Authors: | Wein Lawrence M., Ou Jihong |
Keywords: | scheduling |
For a two-station multiclass queueing network in heavy traffic, the authors assess the improvement from scheduling (job release and priority sequencing) that can occur relative to Poisson input and first-come first-served (FCFS) sequencing. In particular, simple upper bounds are derived on the optimal objective function value (found in Wein) of a Brownian control problem that approximates (via Harrison’s model) a two-station queueing network scheduling problem in heavy traffic. When the system is perfectly balanced, the Brownian analysis predicts that optimal scheduling will reduce the long run expected average number of customers in the network