Periodic routing to parallel queues and billiard sequences

Mathematical Methods of Operations Research

Volumn 59, Issue 2, 2004, Pages 173-192

  Hordijk, Arie ^a   Van Der Laan, Dinard ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

Billiard sequences; Parallel queues; Periodic routing; Total unbalance; Upper bound

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

PARALLEL QUEUES; PERIODIC ROUTING; TOTAL UNBALANCE; UPPER BOUND;

QUEUEING THEORY;

EID: 21144454001     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860300322     Document Type: Article

References (14)

1. Altman E, Gaujal B, Hordijk A (2000) Admission control in stochastic event graphs. IEEE Trans Automat Control 45:854-867
2. Altman E, Gaujal B, Hordijk A (2000) Multimodularity, convexity and optimization properties. Math Oper Res 25:324-347
3. Arian Y, Levy Y (1992) Algorithms for generalized round robin routing. Oper Res Lett 12:313-319
4. Arnoux P, Mauduit C, Shiokawa I, Tamura J (1994) Complexity of sequences defined by billiards in the cube. Bull Soc Math France 122:1-12
5. Bar-Noy A, Bhatia R, Naor J, Schieber B (1998) Minimizing service and operation costs of periodic scheduling. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 11-20
6. Baryshnikov Y (1995) Complexity of trajectories in rectangular billiards. Comm Math Phys 175:43-56
7. Gaujal B, Hyon E (2001) Optimal routing policy in two deterministic queues. Calculateurs Paralléles 13:601-634
8. Gross D, Harris CM (1974) Fundamentals of queueing theory. Wiley Series in Probability and Mathematical Statistics
9. Hajek B (1985) Extremal splittings of point processes. Math Oper Res 10:543-556
10. Hordijk A, van der Laan DA (2002) The unbalance and bounds on the average waiting time for periodic routing to one queue. Mathematical Methods of Operations Research 59:1-24
11. Hordijk A, and van der Laan DA (2002) On the average waiting time for regular routing to deterministic queues. MI Report no. 2002-24, Leiden University. To appear in Mathematics of Operations Research
12. van der Laan DA (2000) Routing jobs to servers with deterministic service times. MI Report no. 2000-20, Leiden University
13. Sano S, Miyoshi N (2000) Applications of m-balanced sequences to some network scheduling problems. In: Discrete Event system: Analysis and Control. Proceedings of the 5th Workshop on Discrete Event Systems (WODES 2000), Kluwer Academic Publisher, pp. 317-325
14. Shirakawa H, Mori M, Kijima M (1989) Evaluation of Regular Splitting Queues. Comm. Statist Stochastic Models 5:219-234