skip to main content
column

Pricing and queueing

Published:04 January 2012Publication History
Skip Abstract Section

Abstract

We consider a pricing in a single observable queue, where customers all have the same valuation, V , and the same waiting cost, v. It is known that earning rate is maximized in such a model when state-dependent pricing is used and an admissions threshold is deployed whereby arriving customers may not join the queue if the total number of customers exceeds this threshold. This paper is the first to explicitly derive the optimal threshold. We use our explicit formulation to obtain asymptotic results on how the threshold grows with V.

References

  1. Chen, H. and Frank, M. (2001). State dependent pricing with a queue. IIE Transactions, 33(10):847--860.Google ScholarGoogle ScholarCross RefCross Ref
  2. Corless, R., Gonnet, G., Hare, D., Jeffrey, D., and Knuth, D. (1996). On the Lambert W function. Advances in Computational Mathematics, 5(1):329--359.Google ScholarGoogle ScholarCross RefCross Ref
  3. Gupta, D. and Weerawat, W. (2006). Supplier-manufacturer coordination in capacitated two-stage supply chains. European Journal of Operational Research, 175(1):67--89.Google ScholarGoogle ScholarCross RefCross Ref
  4. Libman, L. and Orda, A. (2002). Optimal retrial and timeout strategies for accessing network resources. Networking, IEEE/ACM Transactions on, 10(4):551--564. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Naor, P. (1969). The regulation of queue size by levying tolls. Econometrica: journal of the Econometric Society, pages 15--24.Google ScholarGoogle Scholar

Index Terms

  1. Pricing and queueing

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM SIGMETRICS Performance Evaluation Review
        ACM SIGMETRICS Performance Evaluation Review  Volume 40, Issue 3
        December 2012
        108 pages
        ISSN:0163-5999
        DOI:10.1145/2425248
        Issue’s Table of Contents

        Copyright © 2012 Copyright is held by the owner/author(s)

        Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 4 January 2012

        Check for updates

        Qualifiers

        • column

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader