Skip to main content

Customer Threshold Strategies in Observable Queues with Partial Information of Service Time

  • Conference paper
Information Computing and Applications (ICICA 2012)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 307))

Included in the following conference series:

Abstract

This paper concerns customers’ decision process of joining or balking at their arrival instants in an observable queue. Given partial information that different number of moments of the service time is available to the arriving customers, they need to estimate its distribution by using only the information available and no other information based on the maximum entropy principle to decide whether join or balk. Respectively for the systems with risk-neutral and risk-averse customers, we numerically find that in general the equilibrium thresholds are no less than the socially optimal one which is also no less than the profit-maximizing one.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Guo, P., Zipkin, P.: The effect of the availability of waiting-time information on a balking queue. European Journal of Operational Research 198, 199–209 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  2. Armony, M., Shimkin, N., Whitt, W.: The impact of delay announcements in many-server queues with abandonment. Operations Research 57, 66–81 (2009)

    Article  MATH  Google Scholar 

  3. Sun, W., Guo, P., Tian, N.: Equilibrium threshold strategies in observable queueing systems with setup/closedown times. Central European Journal of Operations Research 18, 241–268 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  4. Guo, P., Sun, W., Wang, Y.: Equilibrium and optimal strategies to join a queue with partial information on service times. European Journal of Operational Research 214, 284–297 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  5. Kapur, J.N., Kesavan, H.K.: Entropy optimization principles with applications. Academic Press, Boston (1992)

    Google Scholar 

  6. Hassin, R., Haviv, M.: Equilibrium Behavior in Queueing Systems: To Queue or not to Queue. Kluwer Academic Publishers, Boston (2003)

    Book  Google Scholar 

  7. Naor, P.: The regulation of queue size by levying tolls. Econometrica 37, 15–24 (1969)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sun, W., Li, S. (2012). Customer Threshold Strategies in Observable Queues with Partial Information of Service Time. In: Liu, C., Wang, L., Yang, A. (eds) Information Computing and Applications. ICICA 2012. Communications in Computer and Information Science, vol 307. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34038-3_63

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34038-3_63

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34037-6

  • Online ISBN: 978-3-642-34038-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics