Annals of Operations Research

, Volume 167, Issue 1, pp 337–352

The multiple server center location problem

Authors

    • College of Business AdministrationCalifornia State University San Marcos
  • Oded Berman
    • Joseph L. Rotman School of ManagementUniversity of Toronto
  • Zvi Drezner
    • College of Business and EconomicsCalifornia State University Fullerton
Article

DOI: 10.1007/s10479-008-0341-2

Cite this article as:
Aboolian, R., Berman, O. & Drezner, Z. Ann Oper Res (2009) 167: 337. doi:10.1007/s10479-008-0341-2

Abstract

In this paper, we introduce the multiple server center location problem. p servers are to be located at nodes of a network. Demand for services of these servers is located at each node, and a subset of nodes are to be chosen to locate one or more servers in each. Each customer selects the closest server. The objective is to minimize the maximum time spent by any customer, including travel time and waiting time at the server sites. The problem is formulated and analyzed. Results for heuristic solution approaches are reported.

Copyright information

© Springer Science+Business Media, LLC 2008