Journal of Scheduling

, Volume 15, Issue 2, pp 181–192 | Cite as

Using aggregation to construct periodic policies for routing jobs to parallel servers with deterministic service times



The problem of routing deterministic arriving jobs to parallel servers with deterministic service times, when the job arrival rate equals the total service capacity, requires finding a periodic routing policy. Because there exist no efficient exact procedures to minimize the long-run average waiting time of arriving jobs, heuristics to construct periodic policies have been proposed. This paper presents an aggregation approach that combines servers with the same service rate, constructs a policy for the aggregated system, and then disaggregates this policy into a feasible policy for the original system. Computational experiments show that using aggregation not only reduces average waiting time but also reduces computational effort.


Aggregation Fair sequences Deterministic routing policies 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Altman, E., Gaujal, B., & Hordijk, A. (2000). Balanced sequences and optimal routing. Journal of the ACM, 47(4), 752–775. CrossRefGoogle Scholar
  2. Arian, Y., & Levy, Y. (1992). Algorithms for generalized round robin. Operations Research Letters, 12, 313–319. CrossRefGoogle Scholar
  3. Balinski, M. L., & Young, H. P. (1982). Fair representation. New Haven: Yale University Press. Google Scholar
  4. Bar-Noy, A., Bhatia, R., Naor, J., & Schieber, B. (2002). Minimizing service an operation costs of periodic scheduling. Mathematics of Operations Research, 27, 518–544. CrossRefGoogle Scholar
  5. Combé, M. B., & Boxma, O. J. (1994). Optimization of static traffic allocation policies. Theoretical Computer Science, 125, 17–43. Google Scholar
  6. Corominas, A., Kubiak, W., & Palli, N. M. (2007). Response time variability. Journal of Scheduling, 10, 97–110. CrossRefGoogle Scholar
  7. Hajek, B. (1985). Extremal splittings of point processes. Mathematics of Operations Research, 10, 543–556. CrossRefGoogle Scholar
  8. Herrmann, J. W. (2007). Generating cyclic fair sequences using aggregation and stride scheduling (Technical Report 2007-12). Institute for Systems Research, University of Maryland, College Park. Accessed 1 November 2010.
  9. Herrmann, J. W. (2008). Constructing perfect aggregations to eliminate response time variability in cyclic fair sequences (Technical Report 2008-29). Institute for Systems Research, University of Maryland, College Park. Accessed 1 November 2010.
  10. Herrmann, J. W. (2009a). Generating cyclic fair sequences for multiple servers. In MISTA 2009, Dublin, Ireland, August 10–12, 2009. Google Scholar
  11. Herrmann, J. W. (2009b). Using aggregation to reduce response time variability in cyclic fair sequences. Journal of Scheduling. doi: 10.1007/s10951-009-0127-7.
  12. Hordijk, A., & van der Laan, D. (2005). On the average waiting time for regular routing to deterministic queues. Mathematics of Operations Research, 30(2), 521–544. CrossRefGoogle Scholar
  13. Hordijk, A., Koole, G. M., & Loeve, J. A. (1994). Analysis of a customer assignment model with no state information. Probability in the Engineering and Informational Sciences, 8, 419–429. CrossRefGoogle Scholar
  14. Kubiak, W. (2004). Fair sequences. In J. Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis (pp. 1–21). Boca Raton: Chapman & Hall/CRC Press. Google Scholar
  15. Kubiak, W. (2009). Proportional optimization and fairness. New York: Springer. Google Scholar
  16. Nowicki, E., & Smutnicki, C. (1989). Worst-case analysis of an approximation algorithm for flow shop scheduling. Operations Research Letters, 8, 171–177. CrossRefGoogle Scholar
  17. Rock, H., & Schmidt, G. (1983). Machine aggregation heuristics in shop scheduling. Methods of Operations Research, 45, 303–314. Google Scholar
  18. Rogers, D. F., Plante, R. D., Wong, R. T., & Evans, J. R. (1991). Aggregation and disaggregation techniques and methodology in optimization. Operations Research, 39(4), 553–582. CrossRefGoogle Scholar
  19. Sano, S., Miyoshi, N., & Kataoka, R. (2004). m-balanced words: a generalization of balanced words. Theoretical Computer Science, 314(12), 97–120. CrossRefGoogle Scholar
  20. van der Laan, D. A. (2000). Routing jobs to servers with deterministic service times (Technical Report 2000-20). Leiden University. Google Scholar
  21. van der Laan, D. A. (2003). The structure and performance of optimal routing sequences. Ph.D. thesis, Leiden University, Leiden, The Netherlands. Google Scholar
  22. van der Laan, D. A. (2005). Routing jobs to servers with deterministic service times. Mathematics of Operations Research, 30(1), 195–224. CrossRefGoogle Scholar
  23. Waldspurger, C. A., & Weihl, W. E. (1995). Stride scheduling: deterministic proportional-share resource management. Technical Memorandum MIT/LCS/TM-528, MIT Laboratory for Computer Science, Cambridge, Massachusetts. Google Scholar
  24. Wei, W. D., & Liu, C. L. (1983). On a periodic maintenance problem. Operations Research Letters, 2(2), 90–93. CrossRefGoogle Scholar
  25. Yum, T. P. (1981). The design and analysis of a semi-dynamic deterministic routing rule. IEEE Transactions on Communications, 29, 498–504. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.A. James Clark School of EngineeringUniversity of MarylandCollege ParkUSA

Personalised recommendations