Skip to main content

Strategic Customer Behaviors in Observable Multi-server Batch Service Queueing Systems with Shared Fee and Server Maintenance Cost

  • Conference paper
  • First Online:
Performance Evaluation Methodologies and Tools (VALUETOOLS 2022)

Abstract

We consider an observable multi-server batch service queueing model where a shared server admission fee and maintenance cost for the monopolist are considered. Specifically, customers observe the number of full batches and waiting customers for an uncompleted batch, and then afterward decide to join or balk depending on their utility function. We analyze strategic customer behavior and find the equilibrium strategy. We also show numerical results for social welfare and monopolist’s revenue in various settings depending on fee, batch size, and number of servers. Based on our results, we discuss the existence of optimal fee, batch size, and number of servers.

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 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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

References

  1. Agatz, N., Erera, A., Savelsbergh, M., Wang, X.: Optimization for dynamic ride-sharing: a review. Eur. J. Oper. Res. 223(2), 295–303 (2012)

    Article  MATH  Google Scholar 

  2. Boudali, O., Economou, A.: Optimal and equilibrium balking strategies in the single server markovian queue with catastrophes. Eur. J. Oper. Res. 218(3), 708–715 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  3. Boudali, O., Economou, A.: The effect of catastrophes on the strategic customer behavior in queueing systems. Naval Res. Logistics (NRL) 60(7), 571–587 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bountali, O., Economou, A.: Equilibrium joining strategies in batch service queueing systems. Eur. J. Oper. Res. 260(3), 1142–1151 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bountali, O., Economou, A.: Equilibrium threshold joining strategies in partially observable batch service queueing systems. Ann. Oper. Res. 277(2), 231–253 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bountali, O., Economou, A.: Strategic customer behavior in a two-stage batch processing system. Queueing Syst. 93(1), 3–29 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  7. Canbolat, P.G.: Bounded rationality in clearing service systems. Eur. J. Oper. Res. 282(2), 614–626 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  8. Czerny, A.I., Guo, P., Hassin, R.: Hide or advertise: the carrier’s choice of waiting time information strategies. SSRN 3282276 (2018)

    Google Scholar 

  9. Economou, A., Manou, A.: Equilibrium balking strategies for a clearing queueing system in alternating environment. Ann. Oper. Res. 208(1), 489–514 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  10. Ghare, P.: Multichannel queuing system with bulk service. Oper. Res. 16(1), 189–192 (1968)

    Article  MATH  Google Scholar 

  11. Logothetis, D., Economou, A.: Routing of strategic passengers in a transportation station. In: Ballarini, P., Castel, H., Dimitriou, I., Iacono, M., Phung-Duc, T., Walraevens, J. (eds.) EPEW/ASMTA -2021. LNCS, vol. 13104, pp. 308–324. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-91825-5_19

    Chapter  Google Scholar 

  12. Manou, A., Economou, A., Karaesmen, F.: Strategic customers in a transportation station: when is it optimal to wait? Oper. Res. 62(4), 910–925 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  13. Nakamura, A., Phung-Duc, T.: Stationary analysis of infinite server queue with batch service. In: Ballarini, P., Castel, H., Dimitriou, I., Iacono, M., Phung-Duc, T., Walraevens, J. (eds.) EPEW/ASMTA -2021. LNCS, vol. 13104, pp. 411–424. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-91825-5_25

    Chapter  Google Scholar 

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

    Article  MATH  Google Scholar 

  15. Neuts, M.F.: A general class of bulk queues with poisson input. Ann. Math. Stat. 38(3), 759–770 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  16. Nguyen, H.Q., Phung-Duc, T.: M/m/\(c\)/setup queues: conditional mean waiting times and a loop algorithm to derive customer equilibrium threshold strategy. In: Gilly, K., Thomas, N. (eds.) Computer Performance Engineering. LNCS, vol. 13659, pp. 68–99. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-25049-1_6

    Chapter  Google Scholar 

  17. Wang, J., Zhang, Y., Zhang, Z.G.: Strategic joining in an M/M/\(K\) queue with asynchronous and synchronous multiple vacations. J. Oper. Res. Soc. 72(1), 161–179 (2021)

    Article  Google Scholar 

  18. Wong, Y.Z., Hensher, D.A., Mulley, C.: Mobility as a service (MaaS): charting a future context. Transp. Res. Part A: Policy Pract. 131, 5–19 (2020)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ayane Nakamura .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nakamura, A., Phung-Duc, T. (2023). Strategic Customer Behaviors in Observable Multi-server Batch Service Queueing Systems with Shared Fee and Server Maintenance Cost. In: Hyytiä, E., Kavitha, V. (eds) Performance Evaluation Methodologies and Tools. VALUETOOLS 2022. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 482. Springer, Cham. https://doi.org/10.1007/978-3-031-31234-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-31234-2_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-31233-5

  • Online ISBN: 978-3-031-31234-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics