Optimization Theory, Methods, and Applications in Engineering 2014View this Special Issue
Research Article | Open Access
Peishu Chen, Wenhui Zhou, Yongwu Zhou, "Equilibrium Customer Strategies in the Queue with Threshold Policy and Setup Times", Mathematical Problems in Engineering, vol. 2015, Article ID 361901, 11 pages, 2015. https://doi.org/10.1155/2015/361901
Equilibrium Customer Strategies in the Queue with Threshold Policy and Setup Times
We consider the equilibrium behavior of customers in the queue with policy and setup times. The server is shut down once the system is empty and begins an exponential setup time to start service again when the number of customers in the system accumulates the threshold . We consider the equilibrium threshold strategies for fully observable case and mixed strategies for fully unobservable case, respectively. We get various performance measures of the system and investigate some numerical examples of system size, social benefit, and expected cost function per unit time for the two different cases under equilibrium customer strategies.
Due to wide applications for management in service system and modern electronic commerce, there exists an emerging trend to study the behavior of customers in queueing systems. In these models, the customers decide to join or balk in a decentralized way. Their decisions are affected by how much system information can be observed and how other customers make their decisions. This can be viewed as a game among the customers. Researches about the economic analysis of queueing models can go back at least to the pioneering work of Naor  who analyzed customers’ optimal strategies in an observable Markovian queue with a concise reward-cost structure. Naor’s model and results had already been extended by several authors; readers can refer to [2–4].
The concept of an policy was first introduced by Yadin and Naor . The server is immediately turned on whenever or more customers are present in the system and turned off once there are no customers in the system. Once the server is shut down, the server may not operate until customers are present in the model. Wang and Ke  studied the optimal operation of a single removable server in an queueing system with either infinite waiting room or finite waiting room by a supplementary variable technique, where the “removable server” is merely an abbreviation for the system of turning on and turning off the server depending on the number of customers in the queue. Wang et al.  further consider an queueing system with policy, where the server is typically subject to breakdowns unpredictably.
Guo and Hassin  first consider customers’ strategic behavior and social optimization in a single Markovian queue with policy, in which the server is activated if there are customers in the system and turned off once there are no customers in the system. They found an interesting conclusion which is that a customer can bring positive externality to others by joining, which means that a new arrival can either keep the server operational for a longer time or stir up an inactive server to come back to work sooner, which leads to promoting other customers’ benefits. Guo and Li  further investigated customers’ strategic behavior and social optimization in queues with policy under two partial information cases.
Queues with setup times have also been investigated by many scholars [6, 10–12]. In queueing systems with setup times, once server is reactivated, a generally random time is required for setup before it can start serving customers. As for the research on the equilibrium customer behavior in Markovian queues with setup times was first presented by Burnetas and Economou . Subsequently, Economou and Kanta  further investigated the Markovian queue that alternates between on and off periods in observable cases. Chen and Zhou  studied three different scenarios of balking strategies in the Markovian queue with setup times and server breakdowns.
Frequent setups will inevitably lead to the operating cost being too high, so it is very crucial to determine when the server should start his service in many practical queueing systems. By utilizing policy, the server does not turn on his service until the number of customers in the system accumulates a threshold . Selecting appropriate value can avoid excessively frequent setups. It is more practical to analyze equilibrium strategies for the policy system with setup times. For example, from an economic perspective, a driver may start driving a shuttle whenever a certain amount of seats is occupied. Another example is a queue-based power-saving scheme to alleviate the energy hole problem [16, 17]. Handling with sensor nodes in wireless sensor networks (WSNs) is actually crucial to understand the optimal operation of the threshold policy for power saving in a WSN. In the “ policy” scheme, when the number of packets accumulates to , the sensor node turns on its transmitting function of the radio sever and starts transmission process for the waiting packets. The sensor node is closed as soon as all present packets are transmitted. The policy holds effective for a power-saving mechanism since it reduces the setup power consumption required to switch between a busy mode and an idle mode of a radio server in sensor nodes. The proposed queue-based power-saving technique can be used for prolonging the lifetime of the WSN effectively and economically. To the best of our knowledge, no other scientific paper has dealt with equilibrium customer strategies in the Markovian queue with policy and setup times. Customers make their decisions based on a nature reward-cost structure, which incorporates their desire for service as well as their unwillingness to wait. We discuss, respectively, the fully observable scenario where customers are informed not only about the server state but also about the exact number of customers in the queue and the fully unobservable scenario where an arriving customer does not observe the exact number of customers waiting for service and the state of server at all.
The structure of this paper is organized as follows. In Section 2, we describe the dynamics of the queueing system. In Section 3, we obtain the equilibrium threshold strategies for the fully observable case and stationary probabilities of the corresponding queue. In Section 4, we derive the stationary probabilities and equilibrium mixed strategies for the fully unobservable case. In Section 5, some numerical results are presented to illustrate the effect of two different information levels and policy on the customers’ strategies. Finally, Section 6 provides some conclusions.
2. Model Description
We assume that there is a single server queue with infinite capacity where customers arrive according to a Poisson process with rate . The service times are supposed to be exponentially distributed with parameter . We further assume that . The server utilizes the policy: turn the server on as soon as or more customers are present in the system and turn the server off whenever there are no customers in the system. After the server is shut down, the server cannot work until customers are presented in the queue and a setup process begins for the server to be activated. The time needed to setup is exponentially distributed with rate . We further suppose that interarrival times, service times, and setup times are mutually independent.
We denote the state of the system at time by a random vector , where denotes the state of the server and denotes the number of customers in the system. More specifically, , , implies that the system is on policy with customers in the system; , , means that the system is on setup times with customers in the system; , , corresponds to the server which is busy with customers in the system. It is clear that the process is a continuous time Markov chain with state space . The transition rate diagram is shown in Figure 1.
In this paper, we suppose that every customer gets a reward of units for completing his service. Moreover, we suppose that there exists a waiting cost of units per time unit that is continuously accumulated from the time that the customer joins the system till the time he leaves the system after he finished service.
3. Equilibrium Strategies and Some Performance Measures for the Fully Observable System
We now commit to the fully observable scenario, which assumes that customers observe not only the server state, but also the exact number of customers in the system. We will study the equilibrium threshold strategies and stationary probabilities for the fully observable case as well as some interesting performance measures of this system.
3.1. Equilibrium Threshold Strategies and Stationary Probabilities for the Fully Observable Case
In order to study the general threshold strategy adopted by all customers in the fully observable case, we will consider the mean overall sojourn time of the customer who is confronted with different server state upon arrival firstly. We start with the fully observable case where customers know the exact state of the system and a customer in state has mean sojourn time as follows.
(I) If a new customer finds the system in state , where , then his expected benefit isLet ; we have (since we assume that in Section 2). Obviously, increases by increasing . That is to say, when the system is on policy, the least expected benefit is the first customer in the system. For the sake of ensuring a customer finds the system in state and still joins the system, we must havewhich means that
(II) If a new customer finds the system in state , where (this phenomenon means the system is in setup phase), then his expected benefit iswhich means that if the server is currently in a setup state, the upper bound on the number of customers that an incoming customer is willing to stay behind is
(III) If a new customer finds the system in state , then his expected benefit iswhich means that the upper bound on the number of service epochs that a customer is willing to wait is
Remark 1. Because any customer in policy state must go through setup state and at last in service state, we have .
Theorem 2. In the fully observable queue with setup times and policy, a customer who observes the server in vacation is motivated to join if or who observes the server in setup state is motivated to join if or who observes the server in service is motivated to join if , or balk otherwise.
Proof. From (3), we immediately find that a customer who observes the server in vacation is motivated to join if and only if . From (5), we find that if an arriving customer observes the server in setup state he is motivated to join on the condition that the number of customers in the system is no more than , which means that . From (7), we find that if an arriving customer observes the server in service he is motivated to join if and only if . If an arriving customer finds the number of customers in the system exceeds , which means that his expected net benefit is negative in any case, then his rational decision is to balk the system.
We now turn our attention to the stationary distribution probabilities. Be aware that if all customers follow the threshold strategy in Theorem 2, then the system follows a Markov chain with state space of the systemThe transition diagram is depicted in Figure 2.
The corresponding stationary distribution is given by the following theorem.
Theorem 3. In the fully observable queue with policy, setup times, and , in which the customers follow the threshold strategy, the stationary probabilities are as follows:where and .
Proof. The stationary distribution of the system is gained from the following balance equations:From (17), we easily get (9) in Theorem 3. From (18) and (19), we get (10) in Theorem 3. We further put in (20) and then we get exact expression of in (11). From (16) and (21), we get and and put them into (22); we immediately get expression (12) in Theorem 3. We further put in (20); then we get exact expression of in (11). From (16) and (21), we get and and then put them into (22); we immediately get expression (12) in Theorem 3. Next, we put and into expression (23); then we have (13) in Theorem 3. From (24) and (25), we haveBy putting into above recursive equation, we have (14). By using the normalizing equation (26), we get the expression of in Theorem 3 by putting (9)–(14) into (26).
Remark 4. Theorem 3 holds for the stationary distribution corresponding to any threshold policy , and not merely to the individually optimal policy specified by and .
3.2. The System Performance Measures for the Fully Observable Case
We now study an expected cost function per unit time for the threshold strategy system. Our objectives are to analyze performance measures of the fully observable system and determine the optimum value of the important control threshold by numerical computations.
(1) The Actual Arrival Rate. Because an arrival balks whenever he finds the system at state or , then the system’s effective arrival rate is given by
(2) The Expected Number of Customers. Let denote the expected number of customers in the threshold strategy system. Then we obtain
(3) The Probability of the Server in Different State. We further give the probability that the server in idle, setup, and busy steady state is as follows:
(4) The Expected Busy Cycle. Let the expected length of the idle period be denoted by . Applying the memoryless property of the Poisson process, the length of the idle period is the sum of exponential random variables, each having a mean of . Hence, the expected length of the idle period is presented by .
The busy cycle for the fully observable case is denoted by , which is the length of time from the beginning of completing all the customers in system to the beginning of the next completing of all the customers in system, which included vacation period, setup period, and busy period. From the relationshipwe can get the expected length of the busy cycle .
(5) The Social Benefit per Time. The social benefit per time unit as soon as all customers follow the equilibrium policy equals
(6) The Expected Cost Function. We next define the following: = holding cost per unit time for every customer present in the system; = cost incurred per busy cycle; = cost per unit time for keeping the server off; = setup cost per unit time for turning the server on; = cost per unit time for keeping the server on and in operation; = a fixed cost for every lost customer.
By using the definitions of all costs listed above, the expected cost function per unit time per customer is given by
4. Equilibrium Strategies and Some Performance Measures for the Fully Unobservable System
We turn our attention to the fully unobservable case, where the customers do not observe the state and system size at all when they join the system. We will study the equilibrium arrival rate and stationary probabilities for the fully unobservable case as well as some interesting performance measures of this system.
4.1. Equilibrium Mixed Strategies and Some Stationary Probabilities for the Fully Unobservable Case
We will prove that there exists a mixed equilibrium strategy. An arriving customer joins the fully unobservable system with a certain probability ; then the effective arrival rate is . If all customers adopt the same mixed strategy, then the system follows a Markov chain which is similar to that described in Figure 1. The state space for the fully unobservable case is identical to the original state space . In addition to substituting for , the state transfer diagram is exactly the same as Figure 1.
Let be the stationary distribution of the corresponding system. Let be the probability that the system is empty.
Theorem 5. In the fully unobservable queue with policy, setup times, and , in which the customers enter the system with probability , the stationary probabilities of the system are given bywhere , , and .
Proof. The balance equations are presented below:From (40), we easily get (34) in Theorem 5. From (41) and (42), we can get (35) in Theorem 5. From (39) and (43), we get and . By substituting them into (44), we immediately get expression (36) in Theorem 5. Next, we put and into expression (45); we can get (37) in Theorem 5. By putting (34)–(37) into (46), we obtain the expression of at last.
Theorem 6. In the fully unobservable queue with policy and setup times, where the customers enter the system with probability , when a customer enters the system in state , his expected sojourn time is given below:and the average sojourn time of an arriving customer is
Proof. Let be the probability that a customer arrives during state , where . From Theorem 5, we can easily get the steady state probabilities of the server:Let be the stationary probability that the queue length is conditional on observing the servers status which is , where and . The conditional probabilities can be written byNote that if the queue length is and the server is busy, the expected sojourn time of the new arriving customer is denoted as , which is the expected service time of the customer in the system, that is, , which means the expected sojourn time upon seeing a busy server isThe expected sojourn time upon seeing a setup server isThe expected sojourn time upon seeing the server on policy isThen the expected sojourn time is given as follows: Then the average sojourn time of an arriving customer is
Next, according to the value of , we divide into two cases as follows.
Case 1. When , the system becomes the fully unobservable queue with setup times and . The average sojourn time reduces toWe consider a tagged customer at his arrival instant, if he decides to enter his expected net benefit which is When , we find that has a unique root in . When , we have for any . The best response for an arriving customer is to join the system. Then we have the following proposition.
Proposition 7. In the fully unobservable queue with setup times and , there exists a unique mixed equilibrium strategy “enter with probability ,” where the vector is given by
This conclusion is consistent with Theorem in .
Case 2. When , we have which means that is strictly convex in and , and then there is a unique minimum point , so that is the minimum sojourn time and satisfies the following equation:It is clear that when , there is no positive equilibrium arrival rate; when , there exists one positive equilibrium arrival rate iff ; when , that is, , the equationhas two real roots and . We analyze the strictly convex carefully and then find that the equilibrium with is unstable, for, with any small increase of the arrival rate, the expected waiting time decreases and more customers will arrive in the system; this will further increase . The equilibrium with and is stable; that is, if there is a small perturbation to them, the system will converge back to them. We denote the stable equilibrium arrival rate as ; then we have the following proposition.
Proposition 8. (a) If , there is no positive equilibrium arrival rate. (b) If , there is one positive equilibrium arrival rate iff . (c) If , there exists positive equilibrium arrival rateand the stable positive equilibrium arrival ratewhere is the positive solution of in (60) and and are the positive solutions of in (61).
4.2. The System Performance Measures for the Fully Unobservable Case
Our objective is to give some interesting performance measures of the fully unobservable system and determine the optimum value of the control threshold by numerical computations.
(1) The Expected Number of Customers. Let denote the expected number of customers in the equilibrium strategy. Then we obtain
(2) The Probability of the Server in Idle, Setup, and Busy Steady State as Follows. Consider
(3) The Expected Busy Cycle. Similar to the fully observable case, the expected length of the idle period is given by and the expected length of the busy cycle .
(4) The Social Benefit per Time. We assume the stable equilibrium arrival rate and all customers follow the equilibrium strategy ; then the social benefit per time unit when all customers follow the equilibrium equals
(5) The Expected Cost Function. By using the definition of each cost listed before, the expected cost function per unit time per customer is given by
5. Numerical Examples
In this section, we obtain some numerical experiments to show the different effects of the fully observable and unobservable information systems. We let , , , and in all the figures. For the fully observable case, from inequality (3), we have for any . We vary the values of positive integer from 1 to 10 in Figures 3, 4, and 5.
In Figure 3, we select and vary the values of positive integer from 1 to 10. We find that, for the fully observable case, the mean customers are an increasing function of and a decreasing function of service rate . For the fully unobservable case, when , from Table 1, we find that the stable arrival rate is reducing by increasing , which means more customers are balking the system, so the system size is reducing by increasing ; when and 1, we find that the stable arrival rate is a constant value and does not change by varying the values of from 1 to 10; the system size which is an increasing function of on account of more customers is blocked. When and are fixed, we find, as for and 0.52, the system size of fully observable is smaller than corresponding fully unobservable . When , and are almost equal. It is clear that when customers know the system size and server state, they may be more rational to decide whether to enter the system, which brings more effective regulation to the system size. When the service rate is very larger than arrival rate and the service reward is generous, which means that customers get fast service, good reward and very few customers balk the system, then such good advantages inevitably lead to the disclosures of information (the server state and system size) having a little effect on the system size.
In Figure 4, we find that, along with the increase of , the social benefits and are on the decline. is bigger than when and select the same ; is almost equal to when and select the same . For unobservable case, when , from Table 1, we know that the equilibrium arrival strategy taken by all the customers is the cost of sojourn time which equals the service reward, which leads to .
In Figure 5, we still select and vary the values of positive integer from 1 to 10. We further fix the following cost parameters: , , , , , and . We find that when and selecting the same , the value of is always bigger than ; when and selecting the same , is almost equal to . If we select appropriate , we can reduce the expected cost for all the fully observable and unobservable cases.
In this paper, we studied the equilibrium behavior of customers in queue with policy and server setup times. We provide fully observable and fully unobservable scenarios with respect to system size and system state provided to arriving customers and derived the equilibrium balking strategies for each case. We mainly study how the policy affects system size, social benefit, and system cost under the condition of equilibrium strategies taken by fully observable and fully unobservable arriving customers.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
This research is partially supported by CPSF (2015M572327), NSFC (71131003, 71371075, and 71271089), and NSFA (KJ2013B162, KJ2013A194, and KJ2014A174). It is also supported by Chaohu University Scientific Research Fund. The authors would like to sincerely thank the anonymous referees and editors for their valuable comments and suggestions which are very helpful for them to improve the presentation of the paper.
- P. Naor, “The regulation of queue size by levying tolls,” Econometrica, vol. 37, no. 1, pp. 15–24, 1969.
- A. Economou and S. Kanta, “Equilibrium customer strategies and social-profit maximization in the single-server constant retrial queue,” Naval Research Logistics, vol. 58, no. 2, pp. 107–122, 2011.
- R. Hassin and M. Haviv, To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems, Kluwer Academic, Boston, Mass, USA, 2003.
- H. Chen and M. Frank, “Monopoly pricing when customers queue,” IIE Transactions, vol. 36, no. 6, pp. 569–581, 2004.
- M. Yadin and P. Naor, “Queueing systems with a removable service station,” Journal of the Operational Research Society, vol. 14, no. 4, pp. 393–405, 1963.
- K.-H. Wang and J.-C. Ke, “A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity,” Applied Mathematical Modelling, vol. 24, no. 12, pp. 899–914, 2000.
- K.-H. Wang, T.-Y. Wang, and W. L. Pearn, “Optimal control of the N policy M/G/1 queueing system with server breakdowns and general startup times,” Applied Mathematical Modelling, vol. 31, no. 10, pp. 2199–2212, 2007.
- P. Guo and R. Hassin, “Strategic behavior and social optimization in Markovian vacation queues,” Operations Research, vol. 59, no. 4, pp. 986–997, 2011.
- P. Guo and Q. Li, “Strategic behavior and social optimization in partially-observable Markovian vacation queues,” Operations Research Letters, vol. 41, no. 3, pp. 277–284, 2013.
- G. Choudhury, “An MX/G/1 queueing system with a setup period and a vacation period,” Queueing Systems, vol. 36, pp. 23–38, 2000.
- W. Bischof, “Analysis of -queues with setup times and vacations under six different service disciplines,” Queueing Systems, vol. 39, no. 4, pp. 265–301, 2001.
- A. Allahverdi, C. T. Ng, T. C. E. Cheng, and M. Y. Kovalyov, “A survey of scheduling problems with setup times or costs,” European Journal of Operational Research, vol. 187, no. 3, pp. 985–1032, 2008.
- A. Burnetas and A. Economou, “Equilibrium customer strategies in a single server Markovian queue with setup times,” Queueing Systems, vol. 56, no. 3-4, pp. 213–228, 2007.
- A. Economou and S. Kanta, “Equilibrium balking strategies in the observable single-server queue with breakdowns and repairs,” Operations Research Letters, vol. 36, no. 6, pp. 696–699, 2008.
- P. Chen and Y. Zhou, “Equilibrium balking strategies in the single server queue with setup times and breakdowns,” Operational Research, vol. 15, no. 2, pp. 213–231, 2015.
- F.-C. Jiang, D.-C. Huang, C.-T. Yang, and F.-Y. Leu, “Lifetime elongation for wireless sensor network using queue-based approaches,” The Journal of Supercomputing, vol. 59, no. 3, pp. 1312–1335, 2012.
- D. H. Lee and W. S. Yang, “The N-policy of a discrete time Geo/G/1 queue with disasters and its application to wireless sensor networks,” Applied Mathematical Modelling, vol. 37, no. 23, pp. 9722–9731, 2013.
Copyright © 2015 Peishu Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.