Abstract
This paper considers a scheduling problem occurring in a specialized service system with parallel servers. In the system, customers are divided into the “ordinary” and “special” categories according to their service needs. Ordinary customers can be served by any server, while special customers can be served only by the flexible servers. We assume that the service time for any ordinary customer is the same and all special customers have another common service time. We analyze three classes of service policies used in practice, namely, policies with priority, policies without priority and mixed policies. The worst-case performance ratios are obtained for all of these service policies.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., & Waarts, O. (1997). On-line load balancing with applications to machine scheduling and virtual circuit routing. Journal of the Association for Computing Machinery, 44, 486–504.
Azar, Y., Naor, J., & Rom, R. (1995). The competitiveness of on-line assignments. Journal of Algorithm, 18, 221–237.
Bell, S. L., & Williams, R. J. (2001). Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy. Annals of Applied Probability, 11, 608–649.
Chen, B., Potts, C. N., & Woeginger, G. J. (1998). A review of machine scheduling: complexity, algorithms and approximability. In D.-Z. Du & P. M. Pardalos (Eds.), Handbook of combinatorial optimization. Dordrecht: Kluwer Academic.
Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. San Francisco: Freeman.
Graham, R. L. (1966). Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45, 1563–1581.
Harrison, J. M. (1998). Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies. Annals of Applied Probability, 8, 822–848.
Horowitz, E., & Sahni, S. (1976). Exact and approximate algorithms for scheduling nonidentical processors. Journal of the Association for Computing Machinery, 23, 317–327.
Mokotoff, E. (2001). Parallel machine scheduling problems: a survey. Asia-Pacific Journal of Operational Research, 18, 193–242.
Pinedo, M. (2002). Scheduling: theory, algorithms, and systems, 2nd edn. Englewood Cliffs: Prentice-Hall.
Sahni, S. (1976). Algorithms for scheduling independent tasks. Journal of the Association for Computing Machinery, 23, 116–127.
Wang, Z. (2006). Research on on-line service scheduling. Ph.D. dissertation, Department of Mathematical Sciences, Tsinghua University, Beijing, China (in Chinese).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, Z., Xing, W. Performance of service policies in a specialized service system with parallel servers. Ann Oper Res 159, 451–460 (2008). https://doi.org/10.1007/s10479-007-0264-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-007-0264-3