Volume 49, Number 1, January-March 2015Special ROADEF 2013
|67 - 76
|17 December 2014
Analysis of a clearing queueing system with setup times∗
Department of Basic Courses, Shandong Women’s University, Jinan 250002, P.R. China
Received: 28 August 2013
Accepted: 27 May 2014
We consider a Markovian clearing queueing system with setup times. When the system is empty, the server gets into the state of vacation. Once a new customer arrives the system, an exponential setup time is required before the server renders the service again. The customers are accumulated according to Poisson arrival process and the service times are exponentially distributed. Upon their arrivals, customers decide whether to join or balk the queue based on a natural linear reward-cost structure which reflects their desire for service and their unwillingness to wait. According to the state of server under some condition, we obtain the balking strategies of customers, the stationary distribution of system state, the expected queue length and the social optimal benefit. Finally, some numerical experiments describe how the expected queue length and the social optimal benefit depend on the arrival rate, the service time and the setup time.
Mathematics Subject Classification: 90B22 / 60K25
Key words: Clearing system / setup times / dominant strategy / Nash equilibrium
© EDP Sciences, ROADEF, SMAI, 2014
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.