By Topic

A discrete time queueing system with negative customers and single working vacation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Songfang Jia ; Coll. of Math. & Comput. Sci., Chongqing Three Gorges Univ., Chongqing, China ; Yanheng Chen

In this paper, we analyze a discrete time queueing system with geometrical arrivals of both positive and negative customers in which the server works at a lower rate during working vacation. Using embedded Markov chain and the matrix analysis solution method, we derive the probability generating function (PGF) of the number of customers waiting in the system and stationary queue length. From the process of the proof and the results, we also obtain the probabilities that the server is idle, busy, in working vacation, and in regular busy period, respectively. Finally, We introduce the application of the proposed model.

Published in:

Computer Research and Development (ICCRD), 2011 3rd International Conference on  (Volume:4 )

Date of Conference:

11-13 March 2011