IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Log in (now much improved!) to save this article

Optimal Pricing That Coordinates Queues with Customer-Chosen Service Requirements

Listed author(s):
  • Albert Y. Ha

    ()

    (Yale School of Management, Yale University, 135 Prospect Street, New Haven, Connecticut 06511-3729)

Registered author(s):

    This article considers the problem of coordinating the admission rates and service requirements of a multiclass queue when these decisions are made on a decentralized basis. The customer classes are characterized by different demand patterns, delay costs, and service costs. Customers make individual decisions on whether to join the queue and, if so, their service requirements. Their class identities and service requirements are private information not known to the system manager. We develop a two-stage decision framework to analyze the problem and characterize the optimal admission rates and service requirements under both centralized and decentralized assumptions. We distinguish admission and service externality costs that lead to suboptimal performance under decentralized control. For a given service discipline, we derive optimal class-specific pricing schemes that can coordinate the system when only service requirements but not class identities are unobservable. When customer class identities are also unobservable, we consider two common service disciplines that offer undifferentiated service: processor sharing and first-come-first-served. Based on the general framework, for the M/G/s processor sharing queue, we show that a single variable fee (payment per unit of time in the system) can induce the optimal admission rates and service requirements for all customer classes. For the M/G/1 first-come-first-served queue, we show that a single pricing scheme that is quadratic in time in service can induce the optimal admission rates and service requirements for all customer classes. Our result demonstrates that, under suitable conditions, simple and undifferentiated pricing can coordinate complex queueing systems with heterogeneous customer classes.

    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://dx.doi.org/10.1287/mnsc.47.7.915.9806
    Download Restriction: no

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 47 (2001)
    Issue (Month): 7 (July)
    Pages: 915-930

    as
    in new window

    Handle: RePEc:inm:ormnsc:v:47:y:2001:i:7:p:915-930
    Contact details of provider: Postal:
    7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA

    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Web page: http://www.informs.org/
    Email:


    More information through EDIRC

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    as
    in new window


    1. Jan A. Van Mieghem, 2000. "Price and Service Discrimination in Queuing Systems: Incentive Compatibility of Gc\mu Scheduling," Management Science, INFORMS, vol. 46(9), pages 1249-1267, September.
    2. Moshe Haviv & Ya'acov Ritov, 1998. "Externalities, Tangible Externalities, and Queue Disciplines," Management Science, INFORMS, vol. 44(6), pages 850-858, June.
    3. Albert Y. Ha, 1998. "Incentive-Compatible Pricing for a Service Facility with Joint Production and Congestion Externalities," Management Science, INFORMS, vol. 44(12-Part-1), pages 1623-1636, December.
    4. Colin E. Bell & Shaler Stidham, Jr., 1983. "Individual versus Social Optimization in the Allocation of Customers to Alternative Servers," Management Science, INFORMS, vol. 29(7), pages 831-839, July.
    5. Bradford, Richard M., 1996. "Pricing, routing, and incentive compatibility in multiserver queues," European Journal of Operational Research, Elsevier, vol. 89(2), pages 226-236, March.
    6. Hau Leung Lee & Morris A. Cohen, 1985. "Multi-Agent Customer Allocation in a Stochastic Service System," Management Science, INFORMS, vol. 31(6), pages 752-763, June.
    7. Lui, Francis T, 1985. "An Equilibrium Queuing Model of Bribery," Journal of Political Economy, University of Chicago Press, vol. 93(4), pages 760-781, August.
    Full references (including those not matched with items on IDEAS)

    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:inm:ormnsc:v:47:y:2001:i:7:p:915-930. 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: (Mirko Janc)

    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.