- IravaniFoad and BalciogluBaris (2008), On priority queues with impatient customers, Queueing Systems, 58, 239–260.
- KendallD.G. (1951). Some problems in theory of queues, Journal of Royal Statistical Society. Series B (Methodological), 13, 151–185.
- LakatosL. (2006), A Retrial Queueing System with urgent customers, Journal of Mathematical Sciences, 138, 5405–5409.
- ModeC.J. (1971), Multitype Branching Processes, American Elsevier Publishing Company, Inc. New York.
- MurphyJ.A. and O'DonohoeM.R. (1975), Properties of continued fractions with applications in Markov processes, Journal of the Institute of Mathematics and its Applications, 16, 57–71.
- NeutsM.F. (1969), The queue with Poisson input and general service times, treated as a branching process, Duke Mathematical Journal, 36, 215–231.
- OlofssonP. and ShawC.A. (2002), Exact sampling formulas for multi-type Galton-Watson processes, Journal of Mathematical Biology, 45, 279–293.
- PalmovskiZ., SchlegelS. and BoxmaO. (2003), A tandem queue model with a gate mechanism, Queueing Systems, 43, 349–364.
- ParthasarathyP.R. and LeninR.B. (2004), Birth and Death Process (BDP) Models with Applications — Queueing, Communication Systems, Chemical Models, Biological Models: The State-of-the-Art with a Time-Dependent Perspective, American Series in Mathematical and Management Sciences, 51, American Sciences Press, Inc., Columbus.
- ParthasarathyP. R. and VasudevanK. (2007), A single sever queue with two types of customers in a varying environment, International Journal of Modern Mathematics, 1, 81–101.
- ParthasarathyP. R. and VasudevanK. (2009), A Multi-class Bernoulli Feedback Queue with Gate Mechanism, International Journal of Future Generation Communication and Networking, 2, 37–46.
- ParthasarathyP. R. and VasudevanK. (2010), A single sever queue with a varying gate mechanism, International Journal of Computer Mathematics, 87, 1217–1227.
- RegeK.M. and SenguptaB. (1989), A single server queue with gated Processor-Sharing Discipline, Queueing Systems, 4, 249–261.
A Single Server Queue with Two Types of Customers and a Gate Mechanism
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.