A queueing system with batch renewal input and negative arrivals
Preprint
Abstract
This paper studies an infinite buffer single server queueing model with exponentially distributed service times and negative arrivals. The ordinary (positive) customers arrive in batches of random size according to renewal arrival process, and joins the queue/server for service. The negative arrivals are characterized by two independent Poisson arrival processes, a negative customer which removes the positive customer undergoing service, if any, and a disaster which makes the system empty by simultaneously removing all the positive customers present in the system. Using the supplementary variable technique and difference equation method we obtain explicit formulae for the steady-state distribution of the number of positive customers in the system at pre-arrival and arbitrary epochs. Moreover, we discuss the results of some special models with or without negative arrivals along with their stability conditions. The results obtained throughout the analysis are computationally tractable as illustrated by few numerical examples. Furthermore, we discuss the impact of the negative arrivals on the performance of the system by means of some graphical representations.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Transient solution of a Markovian queuing model with heterogeneous servers and catastrophesOPSEARCH, 2015
- Queues with interruptions: a surveyTOP, 2012
- A discrete-time on–off source queueing system with negative customersComputers & Industrial Engineering, 2011
- Analysis of discrete-time batch service renewal input queue with multiple working vacationsComputers & Industrial Engineering, 2011
- Strong stability of the embedded Markov chain in an GI/M/1 queue with negative customersApplied Mathematical Modelling, 2010
- Performance analysis of discrete-time queue GI/G/1 with negative arrivalsApplied Mathematics and Computation, 2005
- The discrete-time Geo/Geo/1 queue with negative customers and disastersComputers & Operations Research, 2004
- G-networks: A versatile approach for work removal in queueing networksEuropean Journal of Operational Research, 2000
- A numerically efficient method for the MAP/D/1/K queue via rational approximationsQueueing Systems, 1996
- Some corrected results for the queue GI /M/1European Journal of Operational Research, 1984