File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Inducing optimal service capacities via performance-based allocation of demand in a queueing system with multiple servers

TitleInducing optimal service capacities via performance-based allocation of demand in a queueing system with multiple servers
Authors
KeywordsGame theory
Queueing system
Threshold allocation
Issue Date2010
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1800022
Citation
The 40th International Conference on Computers and Industrial Engineering, (CIE 2010), Hyogo, Japan, 25-28 July 2010. In Proceedings of the International Conference on Computers & Industrial Engineering, 2010, p. 1-6 How to Cite?
AbstractIn this paper, we study the use of performance-based allocation of demand in a multiple-server queueing system. The same problem with two servers have been studied in the literature. Specifically, it has been proposed and proved that the linear allocation and mixed threshold allocation policies are, respectively, the optimal state-independent and state-dependent allocation policy in the two-server case. The multiple-server linear allocation has also been shown to be the optimal state-independent policy with multiple servers. In our study, we focus on the use of a multiple-server mixed threshold allocation policy to replicate the demand allocation of a given state-independent policy to achieve a symmetric equilibrium with lower expected sojourn time. Our results indicate that, for any given multiple-server state-independent policy that prohibits server overloading, there exists a multiple-server mixed threshold policy that gives the same demand allocation and thus have the same Nash equilibrium (if any). Moreover, such a policy can be designed so that the expected sojourn time at a symmetric equilibrium is minimized. Therefore, our results concur with previous two-server results and affirm that a trade-off between incentives and efficiency need not exist in the case of multiple servers.
DescriptionTheme: Soft Computing Techniques for Advanced Manufacturing and Service Systems
Persistent Identifierhttp://hdl.handle.net/10722/126238
ISBN
References

 

DC FieldValueLanguage
dc.contributor.authorChoi, SMen_HK
dc.contributor.authorHuang, Xen_HK
dc.contributor.authorChing, WKen_HK
dc.date.accessioned2010-10-31T12:17:25Z-
dc.date.available2010-10-31T12:17:25Z-
dc.date.issued2010en_HK
dc.identifier.citationThe 40th International Conference on Computers and Industrial Engineering, (CIE 2010), Hyogo, Japan, 25-28 July 2010. In Proceedings of the International Conference on Computers & Industrial Engineering, 2010, p. 1-6en_HK
dc.identifier.isbn978-142447295-6-
dc.identifier.urihttp://hdl.handle.net/10722/126238-
dc.descriptionTheme: Soft Computing Techniques for Advanced Manufacturing and Service Systems-
dc.description.abstractIn this paper, we study the use of performance-based allocation of demand in a multiple-server queueing system. The same problem with two servers have been studied in the literature. Specifically, it has been proposed and proved that the linear allocation and mixed threshold allocation policies are, respectively, the optimal state-independent and state-dependent allocation policy in the two-server case. The multiple-server linear allocation has also been shown to be the optimal state-independent policy with multiple servers. In our study, we focus on the use of a multiple-server mixed threshold allocation policy to replicate the demand allocation of a given state-independent policy to achieve a symmetric equilibrium with lower expected sojourn time. Our results indicate that, for any given multiple-server state-independent policy that prohibits server overloading, there exists a multiple-server mixed threshold policy that gives the same demand allocation and thus have the same Nash equilibrium (if any). Moreover, such a policy can be designed so that the expected sojourn time at a symmetric equilibrium is minimized. Therefore, our results concur with previous two-server results and affirm that a trade-off between incentives and efficiency need not exist in the case of multiple servers.en_HK
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1800022-
dc.relation.ispartof40th International Conference on Computers and Industrial Engineering: Soft Computing Techniques for Advanced Manufacturing and Service Systems, CIE40 2010en_HK
dc.rightsProceedings of the International Conference on Computers & Industrial Engineering. Copyright © IEEE.-
dc.rights©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectGame theoryen_HK
dc.subjectQueueing systemen_HK
dc.subjectThreshold allocationen_HK
dc.titleInducing optimal service capacities via performance-based allocation of demand in a queueing system with multiple serversen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailChing, WK:wching@hku.hken_HK
dc.identifier.authorityChing, WK=rp00679en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/ICCIE.2010.5668332en_HK
dc.identifier.scopuseid_2-s2.0-78651459986en_HK
dc.identifier.hkuros175378en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-78651459986&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage1-
dc.identifier.epage6-
dc.publisher.placeUnited States-
dc.description.otherThe 40th International Conference on Computers and Industrial Engineering, (CIE 2010), Hyogo, Japan, 25-28 July 2010. In Proceedings of the International Conference on Computers & Industrial Engineering, 2010, p. 1-6-
dc.identifier.scopusauthoridChoi, SM=26435077400en_HK
dc.identifier.scopusauthoridHuang, X=36617352800en_HK
dc.identifier.scopusauthoridChing, WK=13310265500en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats