Kailash C. Madan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Kailash C. Madan has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
Walid Abu-Dayyeh
4 shared publications- Amjad D. Al-Nasser
Department of Statistics, Faculty of Science, Yarmouk University
2 shared publications Farzana A. Maraghi
School of Information Systems, Computing and Mathematics , Brunel University , Uxbridge, Middlesex, UB8 3PH, UK
2 shared publicationsGautam Choudhury
2 shared publicationsRehab F. Khalaf
2 shared publications- Abedel-Qader S. Al-Masri
Department of Statistics, Yarmouk University, Irbid, Jordan
1 shared publication
Latest Publications
- Open Access
- 8 January 2014
- Published by Wiley in Journal of Probability and Statistics
- Vol. 2014, 1-12
A Batch Arrival Single Server Queue with Server Providing General Service in Two Fluctuating Modes and Reneging during Vacation and Breakdowns
We study the behavior of a batch arrival queuing system equipped with a single server providing general arbitrary service to customers with different service rates in two fluctuating modes of service. In addition, the server is subject to random breakdown. As soon as the server faces breakdown, the customer whose service is interrupted comes back to the head of the queue. As soon as repair process of the server is complete, the server immediately starts providing service in mode 1. Also customers waiting for service may renege (leave the queue) when there is breakdown or when server takes vacation. The system provides service with complete or reduced efficiency due to the fluctuating rates of service. We derive the steady state queue size distribution. Some special cases are discussed and numerical illustration is provided to see the effect and validity of the results.
- 8 January 2014
- Published by Wiley in Journal of Probability and Statistics
- Vol. 2014, 1-12
Open AccessA Batch Arrival Single Server Queue with Server Providing General Service in Two Fluctuating Modes and Reneging during Vacation and Breakdowns
We study the behavior of a batch arrival queuing system equipped with a single server providing general arbitrary service to customers with different service rates in two fluctuating modes of service. In addition, the server is subject to random breakdown. As soon as the server faces breakdown, the customer whose service is interrupted comes back to the head of the queue. As soon as repair process of the server is complete, the server immediately starts providing service in mode 1. Also customers waiting for service may renege (leave the queue) when there is breakdown or when server takes vacation. The system provides service with complete or reduced efficiency due to the fluctuating rates of service. We derive the steady state queue size distribution. Some special cases are discussed and numerical illustration is provided to see the effect and validity of the results.
- 1 January 2012
- Published by Inderscience Publishers in International Journal of Operational Research
- Vol. 15 (1) , 30
On an M[X]/G/1 queuing system with random breakdowns, server vacations, delay times and a standby server
In this work, we study a batch arrival queue with a Bernoulli schedule vacation where after every service completion the server may take a vacation of random length with probability p or may stay in the system providing service with probability 1 − p. Moreover, we assume that the server may breakdown randomly, and the repair process does not start immediately after a breakdown; consequently, there is a delay time waiting for repairs to start. The main new contribution in this work is that we assume that the system is equipped with a standby server to serve the costumers during the vacation period of the main server. The service times, vacation times, repair times and delay times are assumed to follow different general arbitrary distributions while the service times of the standby server follows an exponential distribution.
- 1 January 2012
- Published by Inderscience Publishers in International Journal of Operational Research
- Vol. 15 (1) , 30
On an M[X]/G/1 queuing system with random breakdowns, server vacations, delay times and a standby server
In this work, we study a batch arrival queue with a Bernoulli schedule vacation where after every service completion the server may take a vacation of random length with probability p or may stay in the system providing service with probability 1 − p. Moreover, we assume that the server may breakdown randomly, and the repair process does not start immediately after a breakdown; consequently, there is a delay time waiting for repairs to start. The main new contribution in this work is that we assume that the system is equipped with a standby server to serve the costumers during the vacation period of the main server. The service times, vacation times, repair times and delay times are assumed to follow different general arbitrary distributions while the service times of the standby server follows an exponential distribution.
- Open Access
- 1 January 2011
- Published by Wiley in Journal of Probability and Statistics
- Vol. 2011 (1)
On a Batch Arrival Queuing System Equipped with a Stand‐by Server during Vacation Periods or the Repairs Times of the Main Server
We study a queuing system which is equipped with a stand‐by server in addition to the main server. The stand‐by server provides service to customers only during the period of absence of the main server when either the main server is on a vacation or it is in the state of repairs due to a sudden failure from time to time. The service times, vacation times, and repair times are assumed to follow general arbitrary distributions while the stand‐by service times follow exponential distribution. Supplementary variables technique has been used to obtain steady state results in explicit and closed form in terms of the probability generating functions for the number of customers in the queue, the average number of customers, and the average waiting time in the queue while the MathCad software has been used to illustrate the numerical results in this work.
- 1 January 2011
- Published by Wiley in Journal of Probability and Statistics
- Vol. 2011 (1)
Open AccessOn a Batch Arrival Queuing System Equipped with a Stand‐by Server during Vacation Periods or the Repairs Times of the Main Server
We study a queuing system which is equipped with a stand‐by server in addition to the main server. The stand‐by server provides service to customers only during the period of absence of the main server when either the main server is on a vacation or it is in the state of repairs due to a sudden failure from time to time. The service times, vacation times, and repair times are assumed to follow general arbitrary distributions while the stand‐by service times follow exponential distribution. Supplementary variables technique has been used to obtain steady state results in explicit and closed form in terms of the probability generating functions for the number of customers in the queue, the average number of customers, and the average waiting time in the queue while the MathCad software has been used to illustrate the numerical results in this work.
- 1 March 2010
- Published by Springer Nature in Journal of Statistical Theory and Practice
- Vol. 4 (1) , 137-153
Batch Arrival Vacation Queue with Second Optional Service and Random System Breakdowns
A single server queue with a second optional service, Bernoulli schedule server vacations, and random system breakdowns was analyzed. It is assumed that customers arrive to the system in batches of variable size, but served one by one. As soon as the first service of a customer is completed, then with probability k he may opt for the second service. After a customer is served, the server may decide to leave the system with probability p, or to continue serving customers with probability 1 - p. If the system breaks down, it enters a repair process immediately. The repair time and the vacation time both are assumed to have general distributions. We obtain steady state results in explicit and closed form in terms of the probability generating functions for the number of customers in the queue, the average number of customers, and the average waiting time in the queue. Some special cases of interest are presented and a numerical illustration is provided.
- 1 March 2010
- Published by Springer Nature in Journal of Statistical Theory and Practice
- Vol. 4 (1) , 137-153
Batch Arrival Vacation Queue with Second Optional Service and Random System Breakdowns
A single server queue with a second optional service, Bernoulli schedule server vacations, and random system breakdowns was analyzed. It is assumed that customers arrive to the system in batches of variable size, but served one by one. As soon as the first service of a customer is completed, then with probability k he may opt for the second service. After a customer is served, the server may decide to leave the system with probability p, or to continue serving customers with probability 1 - p. If the system breaks down, it enters a repair process immediately. The repair time and the vacation time both are assumed to have general distributions. We obtain steady state results in explicit and closed form in terms of the probability generating functions for the number of customers in the queue, the average number of customers, and the average waiting time in the queue. Some special cases of interest are presented and a numerical illustration is provided.
- 1 January 2010
- Published by Inderscience Publishers in International Journal of Operational Research
- Vol. 7 (2) , 240
Bernoulli schedule vacation queue with batch arrivals and random system breakdowns having general repair time distribution
We analyse a single server queue with general service time distribution, random system breakdowns and Bernoulli schedule server vacations where after a service completion, the server may decide to leave the system with probability p, or to continue serving customers with probability 1−p. It is assumed that the customers arrive to the system in batches of variable size, but served one by one. If the system breaks down, it enters a repair process immediately. It is assumed that the repair time has general distribution, while the vacation time has exponential distribution. The purpose is to find the steady-state results in explicit and closed form in terms of the probability-generating functions for the number of customers in the queue, the average number of customers and the average waiting time in the queue. Some special cases of interest are discussed and a numerical illustration is provided.
- 1 January 2010
- Published by Inderscience Publishers in International Journal of Operational Research
- Vol. 7 (2) , 240
Bernoulli schedule vacation queue with batch arrivals and random system breakdowns having general repair time distribution
We analyse a single server queue with general service time distribution, random system breakdowns and Bernoulli schedule server vacations where after a service completion, the server may decide to leave the system with probability p, or to continue serving customers with probability 1−p. It is assumed that the customers arrive to the system in batches of variable size, but served one by one. If the system breaks down, it enters a repair process immediately. It is assumed that the repair time has general distribution, while the vacation time has exponential distribution. The purpose is to find the steady-state results in explicit and closed form in terms of the probability-generating functions for the number of customers in the queue, the average number of customers and the average waiting time in the queue. Some special cases of interest are discussed and a numerical illustration is provided.
- 1 January 2007
- Published by Inderscience Publishers in International Journal of Operational Research
- Vol. 2 (1) , 81
A batch arrival Bernoulli vacation queue with a random setup time under restricted admissibility policy
We consider a batch arrival queue with a Bernoulli vacation bschedule, where, after completion of a service, the server either goes for a vacation of random length with probability θ(0 ≤ θ ≤ 1) or may continue to serve the next unit, if any, with probability (1−θ), under a Restricted Admissibility (RA) policy of arriving batches with a random Setup Time (SET). Unlike the usual batch arrival queueing system, the RA-policy differs during a busy period and a vacation period and hence all arriving batches are not allowed to join the system at all times. We derive the steady state queue size distributions at a random point of time as well as at a departure epoch. Also, we obtain some important performance measures of this model. Further, we demonstrate the existence of stochastic decomposition result for this type of model.
- 1 January 2007
- Published by Inderscience Publishers in International Journal of Operational Research
- Vol. 2 (1) , 81
A batch arrival Bernoulli vacation queue with a random setup time under restricted admissibility policy
We consider a batch arrival queue with a Bernoulli vacation bschedule, where, after completion of a service, the server either goes for a vacation of random length with probability θ(0 ≤ θ ≤ 1) or may continue to serve the next unit, if any, with probability (1−θ), under a Restricted Admissibility (RA) policy of arriving batches with a random Setup Time (SET). Unlike the usual batch arrival queueing system, the RA-policy differs during a busy period and a vacation period and hence all arriving batches are not allowed to join the system at all times. We derive the steady state queue size distributions at a random point of time as well as at a departure epoch. Also, we obtain some important performance measures of this model. Further, we demonstrate the existence of stochastic decomposition result for this type of model.
- 1 July 2005
- Published by Elsevier in Mathematical and Computer Modelling
- Vol. 42 (1-2) , 71-85
A two-stage batch arrival queueing system with a modified bernoulli schedule vacation under N-policy
- 1 July 2005
- Published by Elsevier in Mathematical and Computer Modelling
- Vol. 42 (1-2) , 71-85
A two-stage batch arrival queueing system with a modified bernoulli schedule vacation under N-policy
- Open Access
- 1 January 2005
- Published by Taylor & Francis in Journal of Applied Mathematics and Decision Sciences
- Vol. 2005 (3) , 123-135
On vacation queue with two types of general heterogeneous serviceWe analyze a batch arrival queue with a single server providing two kinds of general heterogeneous service. Just before his service starts, a customer may choose one of the services and as soon as a service (of any kind) gets completed, the server may take a vacation or may continue staying in the system. The vacation times are assumed to be general and the server vacations are based on Bernoulli schedules under a single vacation policy. We obtain explicit queue size distribution at a random epoch as well as at a departure epoch and also the mean busy period of the server under the steady state. In addition, some important performance measures such as the expected queue size and the expected waiting time of a customer are obtained. Further, some interesting particular cases are also discussed.
- 1 January 2005
- Published by Taylor & Francis in Journal of Applied Mathematics and Decision Sciences
- Vol. 2005 (3) , 123-135
Open AccessOn vacation queue with two types of general heterogeneous serviceWe analyze a batch arrival queue with a single server providing two kinds of general heterogeneous service. Just before his service starts, a customer may choose one of the services and as soon as a service (of any kind) gets completed, the server may take a vacation or may continue staying in the system. The vacation times are assumed to be general and the server vacations are based on Bernoulli schedules under a single vacation policy. We obtain explicit queue size distribution at a random epoch as well as at a departure epoch and also the mean busy period of the server under the steady state. In addition, some important performance measures such as the expected queue size and the expected waiting time of a customer are obtained. Further, some interesting particular cases are also discussed.
- 1 January 2005
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 160 (2) , 303-308
The admissibility of the LRT for the exponential family model
- 1 January 2005
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 160 (2) , 303-308
The admissibility of the LRT for the exponential family model
- 1 January 2005
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 160 (3) , 909-919
On the Mx/G/1 queue with feedback and optional server vacations based on a single vacation policy
- 1 January 2005
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 160 (3) , 909-919
On the Mx/G/1 queue with feedback and optional server vacations based on a single vacation policy