Sample-path conservation laws, with applications to scheduling queues and fluid systems

Queueing Systems

Volumn 36, Issue 1-3, 2000, Pages 175-199

  Green, Tuell C ^a   Stidham Jr , Shaler ^b  

^a AMR   (United States)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Achievable region; Sample paths; Scheduling queues; Skorohod problem; Strong conservation laws

Indexed keywords

PHYSICAL PROPERTIES; STOCHASTIC SYSTEMS;

ACHIEVABLE REGION; ACHIEVABLE REGION APPROACH; CONSERVATION LAW; NONPREEMPTIVE SCHEDULING; PRE-EMPTIVE SCHEDULING; SAMPLE PATH; SERVICE TIME DISTRIBUTION; SKOROHOD PROBLEM;

SCHEDULING;

EID: 0034310962     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/a:1019183220080     Document Type: Article

References (19)

1. N. Bäuerle and U. Rieder, Optimal control of single-server fluid networks, Queueing Systems 35 (2000) 185-200.
2. D. Bertsimas and J. Niño-Mora, Conservation laws, extended polymatroids and multiarmed bandit problems; a polyhedral approach to indexable systems, Math. Oper. Res. 21(2) (1996) 257-306.
3. E. Coffman and I. Mitrani, A characterization of waiting time performance realizable by single server queues, Oper. Res. 28 (1980) 810-821.
4. M. Dacre, K.D. Glazebrook and J. Niño-Mora, The achievable region approach to the optimal control of stochastic systems, J. Roy. Statist. Soc. B (1999) 747-791.
5. J.G. Dai and W. Dai, A heavy traffic limit theorem for a class of open queueing networks with finite buffers, Queueing Systems 32 (1999) 5-40.
6. J. Edmonds, Submodular functions, matroids and certain polyhedra, in: Combinatorial Structures and Their Applications: Proc. of the Calgary Internat. Conf. on Combinatorial Structures and Their Applications (Gordon and Breach, London, 1970) pp. 69-87.
7. A. Federgruen and H. Groenevelt, Characterization and optimization of achievable performance in general queueing systems, Oper. Res. 36(5) (1988) 733-741.
8. A. Federgruen and H. Groenevelt, M/G/c queueing systems with multiple customer classes: characterization and control of achievable performance under nonpreemptive priority rules, Managm. Sci. 34(9) (1988) 1121-1138.
9. E. Gelenbe and I. Mitrani, Analysis and Synthesis of Computer Systems (Academic Press, London, 1980).
10. T. Green and S. Stidham, Jr., The achievable-region method in the optimal control of queues: A tutorial, Technical Report TR98-3, The University of North Carolina.at Chapel Hill, Chapel Hill, NC (1998).
11. T. Green and S. Stidham, Jr., Sample-path conservation laws and scheduling for general input-output systems, Technical Report, University of North Carolina at Chapel Hill, Chapel Hill, NC (2000) in preparation.
12. T. Konstantopoulos, Notes on the Skorokhod reflection problem (contractive case), Working paper, ECE department, University of Texas at Austin, Austin, TX (February 1999).
13. T. Konstantopoulos and G. Last, Representation and performance of stochastic fluids, Working paper, University of Texas at Austin, Austin, TX (1999).
14. V.G. Kulkarni, Modeling and Analysis of Stochastic Systems (Chapman & Hall, London, 1995).
15. Z. Liu, P. Nain and D. Towsley, Sample path methods in the control of queues, Queueing Systems 21(3,4) (1995) 293-336.
16. M.I. Reiman, Open queueing networks in heavy traffic, Math. Oper. Res. 9(3) (1984) 441-458.
17. M. Shaked and J.G. Shanthikumar, Stochastic Orders and Their Applications (Academic Press, San Diego, 1994).
18. J.G. Shanthikumar and D.D. Yao, Multiclass queueing systems: Polymatroidal structure and optimal scheduling control, Oper. Res. 40 (1992) Supplement 2 S293-S299.
19. D.J. Welsh, Matroid Theory (Academic Press, London, 1976).