Optimal Routing of Fixed Size Jobs to Two Parallel Servers

References

• Aalto S., Virtamo J., Basic packet routing problem, The thirteenth Nordic teletraffic seminar NTS-13, 1996, Trondheim, Norway, 85–97
   Google Scholar
• Agrawala A., E. G., J. C., Garey M., Tripathi S., A stochastic optimization algorithm minimizing expected flow times on uniforn processors, IEEE Transactions on Computers, 1984, 33(4):351–356
   Google Scholar
• Akgun O., Righter R., Wolff R., Multiple server system with flexible arrivals, Advances in Applied Probability, 2011, 43985–1004
   Google Scholar
• Akgun O. T., Down D. G., Righter R., Energy-aware scheduling on heterogeneous processors, IEEE Transactions on Automatic Control, 2014, 59(3
   Google Scholar
• Bhulai S., On the value function of the M/Cox(r)/1 queue, Journal of Applied Probability, 2006, 43(2):363–376
   Google Scholar
• Crovella M. E., Harchol-Balter M., Murta C. D., Task assignment in a distributed system: Improving performance by unbalancing load, Proceedings of SIGMETRICS ‘98, 1998, Madison, Wisconsin, USA, 268–269
   Google Scholar
• Ephremides A., Varaiya P., Walrand J., A simple dynamic routing problem, IEEE Transactions on Automatic Control, 1980, 25(4):690–693
   Web of Science ®Google Scholar
• Feng H., Misra V., Mixed scheduling disciplines for network flows, SIGMETRICS Perform. Eval. Rev., 2003, 3136–39
   Google Scholar
• Franx G. J., A simple solution for the M/D/c waiting time distribution, Oper. Res. Lett., 2001, 29(5):221–229
   Google Scholar
• Frostig E., Levikson B., Optimal routing of customers to two parallel heterogeneous servers: The case of IHR service times, Operations Research, 1999, 47(3):438–444
   Google Scholar
• Haight F. A., Two queues in parallel, Biometrika, 1958, 45(3–4):401–410
   Google Scholar
• Hajek B., Optimal control of two interacting service stations, IEEE Transactions on Automatic Control, 1984, 29(6):491–499
   Web of Science ®Google Scholar
• Harchol-Balter M., Crovella M. E., Murta C. D., On choosing a task assignment policy for a distributed server system, Journal of Parallel and Distributed Computing, 1999, 59204–228
   Web of Science ®Google Scholar
• Hordijk A., Koole G., On the assignment of customers to parallel queues, Probability in the Engineering and Informational Sciences, 1992, 6495–511
   Google Scholar
• Hyytiä E., Lookahead actions in dispatching to parallel queues, Performance Evaluation, 2013, 70(10):859–872 (IFIP Performance’13)
   Google Scholar
• Hyytiä E., Aalto S., Penttinen A., Minimizing slowdown in heterogeneous size-aware dispatching systems, ACM SIGMETRICS Performance Evaluation Review, 2012a, 4029–40
   Google Scholar
• Hyytiä E., Penttinen A., Aalto S., Size- and state-aware dispatching problem with queue-specific job sizes, European Journal of Operational Research, 2012b, 217(2):357–370
   Google Scholar
• Hyytiä E., Penttinen A., Aalto S., Virtamo J., Dispatching problem with fixed size jobs and processor sharing discipline, 23rd International Teletraffic Congress (ITC’23), 2011San Fransisco, USA190–197
   Google Scholar
• Hyytiä E., Virtamo J., Dynamic Routing and Wavelength Assignment Using First Policy Iteration, the Fifth IEEE Symposium on Computers and Communications, ISCC’2000, 2000, Antibes, Juan les Pins, France, 146–151
   Google Scholar
• Johri P. K., Optimality of the shortest line discipline with state-dependent service rates, European Journal of Operational Research, 1989, 41(2):157–161
   Google Scholar
• Kleinrock L.Queueing Systems, Volume I: Theory, 1975, Wiley Interscience
   Google Scholar
• Koole G., A simple proof of the optimality of a threshold policy in a two-server queueing system, Systems and Control Letters, 1995, 26(5):301–303
   Web of Science ®Google Scholar
• Krishnan K. R., Joining the right queue: a state-dependent decision rule, IEEE Transactions on Automatic Control, 1990, 35(1):104–108
   Google Scholar
• Krishnan K. R., Ott T. J., State-dependent routing for telephone traffic: Theory and results, IEEE Conference on Decision and Control, 19862124–2128
   Google Scholar
• Larsen R. L.Control of multiple exponential servers with application to computer systems, 1981, PhD thesis, University of Maryland at College Park, College Park, MD, USA
   Google Scholar
• Lin W., Kumar P., Optimal control of a queueing system with two heterogeneous servers, IEEE Transactions on Automatic Control, 1984, 29(8):696–703
   Web of Science ®Google Scholar
• Lindvall T.Lectures on the Coupling Method, 1992, Wiley
   Google Scholar
• Liu Z., Righter R., Optimal load balancing on distributed homogeneous unreliable processors, Operations Research, 1998, 46(4):563–573
   Google Scholar
• Liu Z., Towsley D., Optimality of the round-robin routing policy, Journal of Applied Probability, 1994, 31(2):466–475
   Google Scholar
• Puterman M. L.Markov Decision Processes: Discrete Stochastic Dynamic Programming, 2005, Wiley
   Google Scholar
• Righter R., Xu S., Scheduling jobs on nonidentical IFR processors to minimize general cost functions, Adv. Appl. Prob., 1991, 23909–924
   Google Scholar
• Véricourt F., Zhou Y.-P., On the incomplete results for the heterogeneous server problem, Queueing Syst. Theory Appl., 2006, 52(3):189–191
   Google Scholar
• Viniotis I., Ephremides A., Extension of the optimality of the threshold policy in heterogeneous multiserver queueing systems, IEEE Transactions on Automatic Control, 1988, 33(1):104–109
   Web of Science ®Google Scholar
• Virtamo J., Aalto S., Procedure for controlling an elevator group, 1996, US Patent 5,503,249
   Google Scholar
• Walrand J., A note on optimal control of a queueing system with two heterogeneous servers, Systems and Control Letters, 1984, 4131–134
   Web of Science ®Google Scholar
• Weber R. R., On the optimal assignment of customers to parallel servers, Journal of Applied Probability, 1978, 15(2):406–413
   Web of Science ®Google Scholar
• Winston W., Optimality of the shortest line discipline, Journal of Applied Probability, 1977, 14181–189
   Web of Science ®Google Scholar