Performance of service policies in a specialized service system with parallel servers

Zhenbo Wang () and Wenxun Xing ()

Annals of Operations Research, 2008, vol. 159, issue 1, 460 pages

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. Copyright Springer Science+Business Media, LLC 2008

Keywords: Parallel machine scheduling; On-line scheduling; Service policy evaluation; Worst-case analysis (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-007-0264-3 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:159:y:2008:i:1:p:451-460:10.1007/s10479-007-0264-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-007-0264-3

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().