IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this article or follow this journal

The Allocation Of Customers In A Discrete-Time Multi-Server Queueing System

  • WEI SUN

    ()

    (School of Economics and Management, Yanshan University, Qinhuangdao, P. R. China)

  • NAISHUO TIAN

    ()

    (College of Science, Yanshan University, Qinhuangdao, P. R. China)

  • SHIYONG LI

    ()

    (School of Electronics and Information Engineering, Beijing Jiaotong University, Beijing, 100044, P. R. China)

Registered author(s):

    This paper, analyzes the allocation problem of customers in a discrete-time multi-server queueing system and considers two criteria for routing customers' selections: equilibrium and social optimization. As far as we know, there is no literature concerning the discrete-time multi-server models on the subject of equilibrium behaviors of customers and servers. Comparing the results of customers' distribution at the servers under the two criteria, we show that the servers used in equilibrium are no more than those used in the socially optimal outcome, that is, the individual's decision deviates from the socially preferred one. Furthermore, we also clearly show the mutative trend of several important performance measures for various values of arrival rate numerically to verify the theoretical results.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL: http://www.worldscinet.com/cgi-bin/details.cgi?type=pdf&id=pii:S0217595910002922
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: http://www.worldscinet.com/cgi-bin/details.cgi?type=html&id=pii:S0217595910002922
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Article provided by World Scientific Publishing Co. Pte. Ltd. in its journal Asia-Pacific Journal of Operational Research.

    Volume (Year): 27 (2010)
    Issue (Month): 06 ()
    Pages: 649-667

    as
    in new window

    Handle: RePEc:wsi:apjorx:v:27:y:2010:i:06:p:649-667
    Contact details of provider: Web page: http://www.worldscinet.com/apjor/apjor.shtml

    Order Information: Email:


    No references listed on IDEAS
    You can help add them by filling out this form.

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:27:y:2010:i:06:p:649-667. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim)

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.