A note on the allocation of queuing facilities using a minisum criterion

Journal of the Operational Research Society

Volumn 48, Issue 2, 1997, Pages 195-201

  Brimberg, J ^a   Mehrez, A ^b,c  

^a ROYAL MILITARY COLLEGE OF CANADA   (Canada)

^b KENT STATE UNIVERSITY   (United States)

^c BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Allocation; Facilities; Queuing

Indexed keywords

FACILITIES; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY; QUEUEING THEORY;

MINISUM CRITERION; PROBABILISTIC ASSIGNMENT; QUEUING FACILITIES;

RESOURCE ALLOCATION;

EID: 0031070727     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600347     Document Type: Article

References (23)

1. Shanthikumar, J. G., Yao, D. D., (1987). Optimal server alloca-tion in a system of multi-server stations. Mt Sci. 33: 1173-1180.
2. Yao, D. D., Shanthikumar, J. G., (1987). The optimal input rateto a system of manufacturing cells. Infor OR25: 57-65.
3. Walrand, J., (1990). Queuing networks. In: Heyman DP andSobel MJ (eds). Handbooks in Operations Research andManagement Science, 2, North-Holland Publishing Co.: NewYork.
4. Harel, A., (1990). Convexity properties of the Erlang lossformula. Opns Res. 38: 499-505.
5. Tu, H. Y., Kumin, H., (1983). A convexity result for a class ofG=G=1 queuing systems. Opns Res 31: 878-950.
6. Larson, R. C., (1974). A hypercube model for facility location andredistricting in urban emergency servicesComputers and. OpnsRes, 1: 67-95.
7. Brandeau, M. L., Chiu, S. S., (1989). An overview of represen-tative problems in location research. Mgmt Sci. 35: 645-674
8. Prasad, S. Y., Batta, R. (1993). Determining efficient facilitylocations on a tree network operating as a FIFO M=G=1. queueNetworks. 23: 597-603.
9. Berman, O., Larson, R. C., Chiu, S. S., (1985). Optimal serverlocation on a network operating as a M=G=1 queue. Opns Res. 33: 746-771.
10. Berman, O., Larson, R. C., (1985). Optimal 2-facility networkdistricting in the presence of queuing. Trans Sci. 19: 261-277.
11. Berman, O., Mandowsky, R. R., (1986). Location-allocation oncongested networks. Eur J Oper Res. 26: 238-250.
12. Chiu, S. S., Berman, O., Larson, R. C., (1985). Locating a mobileserver queuing facility on a network. Mgmt Sci. 31: 764-772.
13. Batt, R., (1989). A queuing-location model with expectedservice time dependent queuing disciplines. Eur J Oper Res. 39: 192-205.
14. Jarvis, J. P., (1981). Optimal assignment in a Markovian queuingsystemComputers and. Op Res.8: 17-23.
15. Carter, M., Chaiken, J. M., Ignal, l. E., (1972). Response areas fortwo emergency units. Opns Res. 20: 571-594.
16. Larson, R. C., Stevenson, K. A., (1972). On insensitivities inurban redistricting and facility location. Op Res. 20: 596-612.
17. Brandeau, M. L., Chiu, S. S., (1994). Location of competingfacilities in a user-optimizing environment with marketexternalities. Trans Sci. 28: 125-140.
18. Brimberg, J., Mehrez, A., Wesolowsky, G. O., (1994). Allocationof queuing facilities using a minimax criterion. Working paper.Available upon request.
19. Zangwill, W. I., (1967). The convex simplex method. Mmt Sci. 14:221-233.
20. Zangwill, W. I., (1969). Nonlinear Programming: A UnifiedApproach. Prentice-Hall Publishing Co.: Englewood Cliffs, NJ.
21. Luenberger, D. G., (1984).Linear and Nonlinear Programming.Second Edition. Addison-Wesley Publishing Co.: Reading, MA.
22. Brandeau, M. L., Chiu, S. S., (1990). Location of public andprivate facilities in a user-optimization environment. Workingpaper, Department of Industrial Engineering and EngineeringManagement: Stanford University, Stanford, CA.
23. Grassmann, W. K., (1983). The convexity of the mean queue size