Assignment of Customers to Servers in a Heterogeneous Queuing System with Switching

Wayne L. Winston
Additional contact information
Wayne L. Winston: Indiana University, Bloomington, Indiana

Operations Research, 1977, vol. 25, issue 3, 469-483

Abstract: We consider a discrete time queuing system composed of a set of servers in parallel in which both customers and servers may be of several types. Customers in service may be switched from one server to another at the beginning of each period. We consider dynamic assignment rules and derive conditions that ensure that it is optimal (in a very strong sense) always to assign customers with longer service times to faster servers.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.25.3.469 (application/pdf)

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:inm:oropre:v:25:y:1977:i:3:p:469-483

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().