Optimal probabilistic allocation of customer types to servers-Reference-Cited by-同舟云学术

Optimal probabilistic allocation of customer types to servers

Published:1995-05 Issue:1 Volume:23 Page:116-125
ISSN:0163-5999
Container-title:ACM SIGMETRICS Performance Evaluation Review
language:en
Short-container-title:SIGMETRICS Perform. Eval. Rev.

Author:

Borst S. C.¹

Affiliation:

1. CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands

Abstract

The model under consideration consists of n customer types attended by m parallel non-identical servers. Customers are allocated to the servers in a probabilistic manner; upon arrival customers are sent to one of the servers according to an m × n matrix of routing probabilities. We consider the problem of finding an allocation that minimizes a weighted sum of the mean waiting times. We expose the structure of an optimal allocation and describe for some special cases in detail how the structure may be exploited in actually determining an optimal allocation.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications,Hardware and Architecture,Software

Link

https://dl.acm.org/doi/pdf/10.1145/223586.223601

Reference11 articles.

1. Design of manufacturing systems using queueing models

2. Optimal load balancing in memory hierarchies. In;Buzen J.P.;J.L. Rosenfeld (North-Holland, Amsterdam),1974

3. Garey M.R. Johnson D.S. (1979). Computers and Intractability: a Guide to the Theory of NP-Completeness (Freeman San Francisco). Garey M.R. Johnson D.S. (1979). Computers and Intractability: a Guide to the Theory of NP-Completeness (Freeman San Francisco).

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Order assignment in a ride-hailing platform with heterogeneous participants;Operations Management Research;2023-09-26

2. Automatic Differentiation over Fluid Models for Holistic Load Balancing;2022 IEEE International Conference on Autonomic Computing and Self-Organizing Systems Companion (ACSOS-C);2022-09

3. Pigouvian Tolls and Welfare Optimality with Parallel Servers and Heterogeneous Customers;Journal of the Indian Institute of Science;2021-09-13

4. Assigning multiple job types to parallel specialized servers;Discrete Event Dynamic Systems;2018-05-17

5. OPTIMAL STATIC ASSIGNMENT AND ROUTING POLICIES FOR SERVICE CENTERS WITH CORRELATED TRAFFIC;Probability in the Engineering and Informational Sciences;2014-03-17