scholarly journals The Effect of a Service Experience Cost on a Queueing System

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Xuelu Zhang ◽  
Qing Ma

In this work, the authors consider the effect of a service experience cost (SE cost) on customer behaviour in the M/M/1 queueing system. Based on customer individual equilibrium strategy, social welfare is also analyzed in unobservable and observable cases. The SE cost decreases the equilibrium joining probability and social welfare in an unobservable case. However, there might exist multiple individual equilibrium thresholds in an observable case. Furthermore, numerical results show that the SE cost can be used as a feasible policy to make an incentive for customers and regulate the system for improved social welfare in some scenarios.

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Qing Ma ◽  
Xuelu Zhang

This work considers a queueing system with N-policy and unreliable server, where potential customers arrive at the system according to Poisson process. If there is no customer waiting in the system, instead of shutting down, the server turns into dormant state and does not afford service until the number of customers is accumulated to a certain threshold. And in the working state, the server is apt to breakdown and affords service again only after it is repaired. According to whether the server state is observable or not, the numerical optimal arrival rates are computed to maximize the social welfare and throughput of the system. The results illustrate their tendency in two cases so that the manager has a strong ability to decide which is more crucial in making management decision.


1994 ◽  
Vol 31 (03) ◽  
pp. 635-645
Author(s):  
Guang-Hui Hsu ◽  
Xue-Ming Yuan

The algorithm for the transient solution for the denumerable state Markov process with an arbitrary initial distribution is given in this paper. The transient queue length distribution for a general Markovian queueing system can be obtained by this algorithm. As examples, some numerical results are presented.


1994 ◽  
Vol 31 (3) ◽  
pp. 635-645 ◽  
Author(s):  
Guang-Hui Hsu ◽  
Xue-Ming Yuan

The algorithm for the transient solution for the denumerable state Markov process with an arbitrary initial distribution is given in this paper. The transient queue length distribution for a general Markovian queueing system can be obtained by this algorithm. As examples, some numerical results are presented.


Author(s):  
Jingchuan Zhang ◽  
Gang Chen ◽  
Zaiming Liu

We study an emerging computer network model of delayed observations in which the system is unobservable for the customers at their arrival instants, but after a while, they are informed about their current positions and they may renege. We develop a queueing-game-theoretic vacation model to explore customers' equilibrium strategy, stationary system behavior and social welfare based on a reward-cost structure. Our main results are as follows. First, we determine a closed form of the customers' equilibrium strategy, the expected net benefit of a customer and social welfare in the service system. Second, extensive numerical experiments that demonstrate the effect of vacation rate θ and system announcement rate δ on the equilibrium strategy and social welfare. We find that the impact of announcement rate δ is greater than vacation rate θ in some cases. Finally, we show that the equilibrium strategy can give customers more information and reduce the cost of waiting. Moreover, our results can also provide more precise information to the system administrators.


Author(s):  
Refael Hassin ◽  
Ricky Roet-Green

Problem definition: We consider a service system in which customers must travel to the queue to be served. In our base model, customers observe the queue length and then decide whether to travel. We also consider alternative information models and investigate how the availability of queue-length information affects customer-equilibrium strategies, throughput, and social welfare. Academic/practical relevance: A common assumption in queueing models is that once a customer decides to join the queue, joining is instantaneous. This assumption does not fit real-life settings, where customers possess online information about the current wait time at the service, but while traveling to the service, its queue length may change. Motivated by this realistic setting, we study how queue-length information prior to traveling affects customers’ decision to travel. Methodology: We prove that a symmetric equilibrium exists in our base model. We perform the calculation numerically as a result of the model complexity, which is due to the fact that the arrival rate to the traveling queue depends on the current state of the service queue, and vice versa. The alternative models are tractable, and we present their analytical solution. Results: When customers can observe the service-queue length prior to traveling, their probability of traveling is monotonically nonincreasing with the observed queue length. We find that customers may adopt a generalized mixed-threshold equilibrium strategy: Travel when observing short queue lengths, avoid traveling when observing long queue lengths, and mix between traveling and not traveling when observing intermediate queue lengths, with a decreasing probability of traveling. Managerial implications: Our results imply that when system congestion is high, the provider can increase throughput by disclosing the queue-length information, whereas at low congestion, the provider benefits from concealing the information. With respect to social welfare, queue-length information prior to departure is beneficial when congestion is at intermediate to high levels and yields the same social welfare otherwise.


Sign in / Sign up

Export Citation Format

Share Document