Heavy traffic resource pooling in parallel-server systems

Queueing Systems

Volumn 33, Issue 4, 1999, Pages 339-368

  Harrison, J Michael ^a   López, Marcel J ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Brownian control problem; Heavy traffic; Parallel server systems; Resource pooling

Indexed keywords

LINEAR PROGRAMMING; SCHEDULING;

CONTROL PROBLEMS; DYNAMIC CONTROL POLICY; HEAVY TRAFFIC LIMIT; HEAVY TRAFFICS; PARALLEL SERVERS; RESOURCE POOLING; SCHEDULING POLICIES; SERVICE TIME DISTRIBUTION;

BROWNIAN MOVEMENT;

EID: 0032647070     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/A:1019188531950     Document Type: Article

References (20)

1. D. Bertsimas and J.N. Tsitsiklis, Introduction to Linear Optimization (Athena Scientific, Belmont, MA, 1997).
2. P.B. Chevalier and L.M. Wein, Scheduling networks of queues: Heavy traffic analysis of a multi-station closed network, Oper. Res. 41 (1993) 743-758.
3. D.R. Cox and W.L. Smith, Queues (Methuen, London, 1961).
4. J.M. Harrison, Brownian Motion and Stochastic Flow Systems (Wiley, New York, 1985).
5. J.M. Harrison, Brownian models of queueing networks with heterogeneous customer populations, in: Stochastic Differential Systems, Stochastic Control Theory and Applications, eds. W. Fleming and P.L. Lions (Springer, New York, 1988) pp. 147-186.
6. J.M. Harrison, The BIGSTEP approach to flow management in stochastic processing networks, in: Stochastic Networks: Theory and Applications, eds. F. Kelly, S. Zachary and I. Ziendins (Oxford Univ. Press, Oxford, 1996).
7. J.M. Harrison, Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies, Ann. Appl. Probab. 8 (1998) 822-848.
8. J.M. Harrison, Brownian models of open processing networks: Canonical representation of workload (1997) submitted for publication.
9. J.M. Harrison and J.A. Van Mieghem, Dynamic control of Brownian networks: State space collapse and equivalent workload formulations, Ann. Appl. Probab. 7 (1997) 747-771.
10. J.M. Harrison and L.M. Wein, Scheduling networks of queues: Heavy traffic analysis of a simple open network, Queueing Systems 5 (1989) 265-280.
11. J.M. Harrison and L.M. Wein, Scheduling networks of queues: Heavy traffic analysis of a two-station closed network, Oper. Res. 38 (1990) 1052-1064.
12. F.P. Kelly and C.N. Laws, Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling, Queueing Systems 13 (1993) 47-86.
13. H.J. Kushner and Y.N. Chen, Optimal control of assignment of jobs to processors under heavy traffic, preprint, Department of Applied Mathematics, Brown University (1998).
14. H.J. Kushner and P. Dupuis, Numerical Methods for Stochastic Control Problems in Continuous Time (Springer, Berlin/New York, 1992).
15. H.J. Kushner and L.F. Martins, Routing and singular control for queueing networks in heavy traffic, SIAM J. Control Optim. 28 (1990) 1209-1233.
16. C.N. Laws, Resource pooling in queueing networks with dynamic routing, Adv. in Appl. Probab. 24 (1992) 699-726.
17. C.N. Laws and G.M. Louth, Dynamic scheduling of a four-station queueing network, Probab. Engrg. Inform. Sci. 4 (1990) 131-156.
18. L.M. Wein, Scheduling networks of queues: Heavy traffic analysis of a two-station network with controllable inputs, Oper. Res. 38 (1990) 1065-1078.
19. L.M. Wein, Brownian networks with discretionary routing, Oper. Res. 39 (1991) 322-340.
20. L.M. Wein, Scheduling networks of queues: Heavy traffic analysis of a multistation network with controllable inputs, Oper. Res. 40 (1992) S312-S334.