Mathematics (Queueing Theory)

Journals

1. 1. Bernoulli Schedule Vacations in a Single Server ‘Queue with Two Phase First Essential Service Followed by Optional Two Phase Additional Service’ , Madan, Kailash C. (2017), Far East Journal of Mathematical Sciences (India), Vol. 101, Isseu 6, pp. 1313-1326.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. On a Batch arrival Queue with Second Optional Service, Random Breakdowns, Delay Time for Repairs to Start and Restricted Admissibility of Arrivals During Breakdown Periods’, Madan, Kailash C. and Malalla, E. (2017), Journal of Mathematical and Computational Science (UK), Vol. 7, No. 1, pp. 175-188.
      Abstract (pdf) / Research area: Mathematics (Queueing Theory)

 

1. 1. ’On Four Models of a Three Server Queeu withOptional Server vacations, Madan, Kailash C. (2016),  International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering, Vol. 10,  No. 8, pp.379-383.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. Time-dependent and Steady State solution of an M(X)/G/1 queueing system with server’s long and short  vacations’, Madan, Kailash C. and Hadjar, Karim (2016), Journal of Mathematical and Computational Science (UK), Vol. 6,  No. 3, pp. 486-506.
      Abstract (pdf) /Research area: Mathematics (Queueing Theory)

 

1. 1. On optional deterministic server vacations in a batch arrival queueing system with a single server providing first essential service followed by one of the two types of additional optional service’, Madan, Kailash C. (2016), Malaya Journal of Matematik  (Singapore), Vol. 4 No. 1, pp. 25-36.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘A batch arrival single server queue with generalized Coxian-2 service and optional generalized Coxian-2 vacation‍’, Madan, Kailash C. (2015), Mathematical Sciences and Applications E Notes (Slovakia), Vol. 3, No. 2, pp. 33-44.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘On a M^[x]/(G_1,G_2)/1  Queue with Third-Stage Optional Service and Deterministic Server Vacations’‍, Madan, Kailash C. (2015) , Journal of Mathematical and Computational Science (UK), Vol. 5 No. 2, 195-206. Scientific and Knowledge Publishing Corporation Limited.
      Abstract (pdf) / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘A Single Server Bulk  Queue with Random failures and Two Phase Repairs with Delay’, Madan, Kailash C. and Malalla E. (2015), Investigacion Operacional (Cuba), Vol. 36, No. 1, pp. 45-59.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘On a Single Server Queue with Arrivals in Batches of Variable Size, General Service in Three Fluctuating Modes, Balking, Random Breakdowns and a Stand-by Server During Breakdown Periods.’, Madan, Kailash C. (2014), Investigacion Operacional (Cuba), Vol. 35, No. 3, pp. 189-200.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1.  ‘A Batch Arrival Singel Server Queue with Server Providing General Service in Two Fluctuating Modes and Reneging During vacations and Breakdowns’, Monita Baruah, Kailash C. Madan and Tillal Eldabi (2013), Journal of Probability and Statistics, (USA),Volume 2014 (2014), Article ID 319318, 12 pages.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘A Two StageBatcharrival Queue with Reenging During Vacation and Breakdown Periods’, Monita Baruah, Kailash C. Madan and Tillal Eldabi (2013), American Journal of Operations Reserach   (USA),  Accepted for Publication 10 October  2013.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘A Batch Arrival Queue with Second Optional Service and Reneging During Vacation Periods’, Monita Baruah, Kailash C. Madan and Tillal Eldabi (2013), Investigacion Operacional   (Cuba),  Vol. 34, No. 3, pp. 244-258.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘Two stage heterogeneous service in a batch arrival vacation queue vacation queue with balking and optional re-service’, Monita Barua, Kailash C. Madan and Tilal Eldabi, Applied Mathematical Sciences (Bulgaria), Vol. 7, No. 17, pp. 837-856, 2013.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘Balking and re-service in a vacation queue with batch arrival and two types of heterogeneous service’, Monita Barua, Kailash C. Madan and Tilal Eldabi (2012),  Journal of Mathematics Research (Canada), Vol. 4, No. 4, pp. 114-124.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘On an M(X)/G/1 queuing system with random breakdowns, server vacations, delay times and a stand-by server’, Rehab F. Khalaf , Kailash C. Madan and Cormac A. Lukas (2012), International Journal of Operational Research (USA), Vol.15, No. 1, pp. 30-47, 2012.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘An M(X)/G/1 queue with Bernoulli schedule general vacation times, general extended vacations, general repair times  for repirs to start and general repair times’, Rehab F. Khalaf , Kailash C. Madan and Cormac A. Lukas (2011), Journal of  Mathematics Research (Canada) , Vol. 3, No. 4, pp. 8-20.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘On a batch arrival queueing system equipped with a stand-by server during vacation periods or the breakdown periods of the main server’, Rehab F. Khalaf , Kailash C. Madan and Cormac A. Lukas (2011), Journal of Probability and Statistics (USA), Vol. 2011,  Article ID 812726, pp. , pp. 1-11, 2011.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘A Non-Preemptive Priority Queueing System with a Single Server Serving Two Queues M/G/1 and M/D/1 with Optional Server Vacations Based on Exhaustive Service of the Priority Units’, Madan, Kailash C. (2011), Applied Mathematics (USA), Vol. 3, No. 2, pp. 791-799,  2011.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘An M[X]/G/1 queue with Bernoulli schedule, general vacation times, random breakdowns, general delay times and general repair times’, Rehab F. Khalaf , Kailash C. Madan and Cormac A. Lukas (2011), Applied Mathematical Sciences (Bulgaria), Vol. 5, No. 1, pp. 35-51.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘A single queue with mutually replacing m servers’, Madan, Kailash C. (2011), Journal of Mathematics Research (Canada), Vol. 3, No. 1, pp 03-08.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. (2010) : ‘Steady State Analysis of a Queue with Restricted Admissibility of Arriving Batches and Modified Bernoulli Schedule Server vacations Based on a Single Vacation Policy’, Journal of Applied Mathematical Sciences (Bulgaria), Vol. 4, No. 46, pp 2271-2292.
      Research area: Mathematics (Queueing Theory)

 

1. 1. ‘queue with restricted admissibility of arriving batches and modified Bernoulli schedule server vacations based on a single vacation policy, Madan, Kailash C. (2010),  Applied Mathematical Sciences (Bulgaria), Vol. 4, No. 46, pp. 2271-2292.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘Bernoulli schedule vacation queue with batch arrivals and random system breakdowns having general repair time distribution’, Farzana Maraghi, Kailash C. Madan and Kenneth Darby-Dowman,(2010), International Journal of Operational Research (USA), Vol. 7, No. 2,  pp. 240-256.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘Batch arrival vacation queue with second optional service and random system breakdowns’,  Farzana Maraghi, Kailash C. Madan and Kenneth Darby-Dowman (December 2010), Journal of Statistical Theory and Practice (USA), Vol. 3, No. 4.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘Batch arrival Bernoulli schedule vacation queue with two types of general heterogeneous service and random system breakdowns’,  Farzana Maraghi, Kailash C. Madan and Kenneth Darby-Dowman (August, 2009), Journal of Probability and Statistical Science (China), Vol. 7, No. 2,  pp. 229-244.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘On an M/G/1 queue with optional server vacations based on exhaustive service and a single vacation policy’, Madan, Kailash C. (2009), Systems Science (Poland) , Vol. 35, No. 4, pp. 21-25, 2009.
      Abstract (pdf) / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘Batch Arrival Queueing System with Random Breakdowns and Bernoulli Schedule  Server Vacations Having General Vacation Time Distribution’, Farzana Maraghi, Kailash C. Madan and Kenneth Darby-Dowman (March, 2009), International Journal of information and Management Sciences (China), Vol. 20, No. 1, pp. 55-70.
      Abstract (pdf) / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘A batch arrival Bernoulli vacationqueue  with a random set up time under restricted admissibility policy’,  Gautam Choudhury and Kailash C. Madan (2007), International Journal of Operational Research (USA), Vol. 2, No. 1, pp. 81-97.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘A batch arrival queue with with Bernoulli vacation schedule under multiple vacation policy’, Gautam Choudhury and Kailash C. Madan (2006), International Journal of Management Sciences (Korea)), Vol. 12, No. 2, pp.1-18.
      Abstract (pdf) / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘Steady State Analysis of an M(x)/(G1,G2)/1 Queue with Restricted Admissibility and Random Setup Time’, Kailash C. Madan and Gautam Choudhury (2006), International Journal of Information and Management Sciences (China),  Volume 17, Number 2, pp 33-56.
      Abstract (pdf) / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘A two-stage batch arrival queueing system with a modified Bernoulli schedule vacation under N-Policy’, Gautam Choudhury. and Kailash C. Madan (2005), Mathematical and Computer Modeling (USA), Volume 42, pp 71-85.
      Abstract (pdf) / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘A single server queue with two phases of heterogeneous service under Bernoulli schedule and general vacation time’, Kailash C. Madan and Gautam Choudhury (2005), International Journal of Information and Management Sciences (China), Vol.  16, Number 2,  pp 1-16.
      Abstract (pdf) / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘A two-stage batch arrival queueing system with a random set-up time under modified Bernoulli schedule vacation’,Gautam Choudhury and Kailash C. Madan (2005), Revista Investigacion Operacional (Cuba), Vol. 26, No. 3, pp. 238-250.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘On a single server queue with phase type service and optional phase type server vacations based on exhaustive service under  a single vacation policy’, Kailash C. Madan and Adel Z. Abu Al-Rub (2005), Journal of Applied Statistical Science (JASS) (USA), Vol. 15, issue 1, pp 49-66.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘On   M(X)/(G1/G2)/1/G(BS)/Vs queue with batch arrivals, two types of general heterogeneous service and general vacation times with Bernoulli schedules under a single vacation policy’, Kailash C. Madan, Ziad Al-Rawi and Amjad D. Al-Nasser (2005), Advances in Decision Sciences (New Zealand), Vol. 2005, No. 3, pp. 123-135.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘On the  M(X)/G/1 queue with feedback and optional server vacations under a single vacation policy’, Kailash C. Madan and Mohammad Rawaash (2005), Applied Mathematics and Computation (Netherlands), Vol 160, No. 3, pp. 909-919.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. Walid Abu-Dayyeh and Kailash C. Madan (2005) : ‘The Admissibility of the LRT for the Exponential Family Model’, Applied Math and Computation [Netherland], Vol. 160, No. 2, pp. 303-308.
      Research area: Mathematics (Queueing Theory)

 

1. 1. ‘An M/G/1 queue with Bernoulli schedules and Coxian-2 server vacations’, Kailash C. Madan and Masuad M. Jahromi (2004) , Systems  Science (Poland), Vol. 29, No. 4, 2004, pp 69-83, 2004.
      Abstract (pdf) / Research area: Mathematics (Queueing Theory)

 

1. 1. ‘Steady State Analysis of an M/(G1,G2)/1 queue with restricted admissibility of arriving batches and modified Bernoulli server vacations under a single vacation policy’, Kailash C. Madan and Gautam Choudhury (2004), Journal of Probability and Statistical Science (China), Vol. 2(2), pp. 167-185.
      Abstract (pdf) / Journal link / Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. and Adel Z. Abu Al-Rub (2004): ‘ On a Single Server Queue with Optional Phase Type Server vacations Based on Exhaustive Deterministic Service and a Single Vacation Policy’, Applied Mathematics and Computation [Netherlands], Vol. 149, Issue 3, 2004, pp. 723-734. Gautam Choudhury and Kailash C. Madan (2004) : ‘A Two Phase Batch Arrival Queueing System With a Vacation Time Under Bernoulli Vacation Schedule’, Applied Math and Computation [Netherland], Vol. 149, Issue 3, 2004, pp 337-349.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Kailash C. Madan and Gautam Choudhury (2004) : ‘An M(X)/G/1 Queue with a Bernoulli Vacation Schedule Under Restricted Admissibility Policy’, Sankhya [India], Vol. 66, Part 1, February, 2004, pp 175-193.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C., Adel Z. Abu Al_Rub (2004): ‘Transient and Steady State Analysis of a Single Server Queue with Modified Bernoulli Schedule Server Vacations Based on Exhaustive Service and a Single Vacation Policy’ Investigacion Operacional [Cuba], Vol. 25, No. 2, pp 158-165.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C., Amjad D. Al-Nasser and Abedel –Qader Al-Masri (2004): ‘M(X)/(G1/G2)/1 Queue with Optional Re-Service, Applied Mathematics and Computation [Netherlands]. Vol. 152, pp. 71-88.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. ,Walid Abu-Dayyeh and Mohamad Ghraibeh (2003): ‘ On Two Parallel Servers with Random Breakdowns ‘, Soochow Journal of Mathematics [Taiwan], Vol. 29, No. 4, pp. 413-423.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. , Walid Abu-Dayyeh and Firas Tayan (2003): ‘ Steady State Analysis of an M/D/2 Queue with Bernoulli Schedule Server Vacations ‘, Journal of Modern Applied Statistical Methods [USA]. May, 2003, Vol. 2, No. 1, pp 202-209.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. and Walid Abu-Dayyeh (2003): ‘ On a Non-Preemptive Priority Queueing System with a Single Server Simultaneously Dealing with Two heterogeneous Queues M/G1/1 queue and M/G2/1 queue ‘, Journal of Probability and Statistical Science [Taiwan]. Vol. 1 No. 2, pp 221-241.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. , Walid Abu-Dayyeh and Mohammad Gharaibeh (2003): ‘Steady State Analysis of Two M(X)/M(a,b)/1 Queue Models with Random breakdowns ‘, International Journal of Information and Management Sciences [Taiwan]. Vol. 14, Number 3, pp 37-51, 2003.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. and Walid Abu-Dayyeh (2003): ‘ On a Combination of M/G/1 and M/D/1 Queues in a Non-Preemptive Priority Queueing System’, Far East Journal of Theoretical Statistics [India], Vol. 10, No. 2, pp 133-146.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Jehad Al-Jararha and Madan, Kailash C. (2003) : ‘An M/G/1 Queue with Second Optional Service with General Service Time Distribution’, International Journal of Information and Management Sciences [Taiwan], Vol. 14, Number 2, pp 47-56.
      43. Raid F. Anabosi and Madan, K. C. (2003) : ‘A Single Server Queue with Two Types of Service, Bernoulli Schedule Server Vacations and a Single Vacation Policy’, Pakistan Journal of Statistics [Pakistan], Vol. 19, No. 3, pp 331-342.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. (2003) : ‘An M/G/1 Type Queue with Time-Homogeneous Breakdowns and Deterministic Repair Times’, Soochow Journal of Mathematics [Taiwan], Vol. 29, No. 1, pp 103-110.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Walid Abu-Dayeeh, Jihad Jarraha and Kailash C. Madan (2003) : ‘LRT Conjecture for Bivariate Normal’, Applied Math and Computation [Netherland], Vol.145, No.1, pp 73-84.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C., Walid Abu-Dayyeh and Firas Tayyan (2003) : ‘A Two-Server Queue with Bernoulli Schedules and a Single Vacation Policy’, Applied Math and Computation [Netherland], Vol. 145, No. 1, pp 59-71.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. and Walid Abu-Dayyeh (2003) : ‘Steady State Analysis of a Single Server Bulk Queue with General Vacation times and Restricted Admissibility of Arriving batches ’, ‘Revista Investigacion Operacional’ [Cuba] , Vol. 24 No. 2, pp 113-123. Walid Abu-Dayyeh and Madan, Kailash C. (2002): ‘ Sufficient Conditions for Admissibility in Case of Two Sided Alternatives for the Exponential Family Models” ‘, Journal of Statistical Theory and Applications [USA], Vol. 1, No. 4, 2002, pp 263-269.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C., Walid Abu-Dayyeh and M F. Saleh (2002): ‘ An M/G/1 Queue with Second Optional Service and Bernoulli Schedule Server Vacations’, Systems Science [Poland],Vol. 28, No. 3, pp. 51-62, 2002. Madan Kailash C. (2002): Two Types of Sequential-cum-Parallel General Optional Service in a Single Server Queue’, Egyptian Statistical Journal (Egypt). Vol. 46, No. 1, pp 92-105.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C (2002) : ‘Balking Phenomenon in the M/G/1 Vacation Queue’, Journal of the Korean Statistical Society [Korea]. Vol. 31, Number 4, pp 1-17.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Jehad Al-Jararha and Madan, Kailash C. (2002) : ‘Steady State Analysis of an M/D/1 Queue with Coxian-2 Server Vacations and a Single Vacation Policy’, International Journal of Information and Management Sciences [Taiwan], Vol. 13, Number 4, pp 69-81.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. and Baklizi, A. (2002) : ‘An M/G/1 Queue with Additional Second Stage Service and Optional Re-Service’, International Journal of Information and Management Sciences [Taiwan], Vol. 13, No. 4, pp. 13-31.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Kailash C. Madan and Ayman Baklizi (2002) : ‘An M/(G1,G2)/1 Queue with Optional Re-Service’, Stochastic Modelling and Applications [India], Vol. 5, No. 1, pp 27-39.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. and Hani, M. Samawi (2002) : ‘Steady State Analysis of an M/D/1 Queue with Two Stages of Heterogeneous Server Vacations ( M/D/G1,G2/1’, ‘Revista Investigacion Operacional’ ,[Cuba] , Vol. 23, No. 2, pp 150-163.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. and Walid Abu-Dayyeh (2002) : ‘Restricted Admissibility of Batches into an M/G/1 Type Bulk Queue with Modified Bernoulli Schedule Server Vacations ’, ‘ESAIM P &S ‘ , [France], Vol. 6, pp 113-125.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. (2002) : ‘An M//1 Queue with Long and Short Server Vacations’, ‘Acta Ciencia Indica’ [India], Vol. XXVIII M, No. 1, pp 17- 26. Madan, Kailash C. (2001): ‘On an M/G/1 Queue with General Bernoulli Schedule Server Vacations’, Journal of Statistical Studies [Bangladesh] , Vol.21, December 2001, pp 33-40.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. and Mohammad F. Saleh (2001) : ‘On an M/D/1 Queue with Deterministic Server Vacations’, Systems Science Journal [Poland], Vol. 27, No. 2, pp. 107-118.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. and Saleh M.F. (2001) : ‘On Single Server Vacation Queues with Deterministic Service or Deterministic Vacations’, ‘Calcutta Statistical Association Bulletin’, [India], Vol. 51, Nos. 203-204, pp 225-241.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. and Saleh M.F. (2001) : ‘On M/D/1 Queue with General Server Vacations’ International Journal of Management and Information Sciences’, [Republic of China], Vol. 12, No. 2, pp 25-37.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. (2001) : ‘On a Single Server Queue with Two-Stage Heterogeneous Service and Deterministic Server Vacations’, International Journal of System’s Science [U.K.], Vol. 32, Number 7, pp 837-844.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. (2000) : ‘On a Single Server Queue with Two-Stage Heterogeneous Service and Binomial Schedule Server Vacations’, Egyptian Statistical Journal [Egypt],Vol. 40, No. 1, pp 39-55.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. (2000) : ‘An M/G/1 Queue with Second Optional Service’, Queueing Systems [USA], 34, 37-46.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. (2000) : ‘An M/M/1 Queueing System with Interrupted Arrival Stream’, Revista Investigacion Operacional [Cuba], Vol. 21, No. 1, pp 35-40.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, Kailash C. (1999) : ‘An M/G/1 Queue with Optional Deterministic Server Vacations’, Metron, [Italy], vol. LVII, no. 3-4, 83-95.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1998) : ‘Steady State Behaviour of an M(x)/M(b)/l Queue with Correlated Arrivals’, Acta Ciencia Indica, [India], Vol. XXIV M, No. 4, 311-316.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1998) : ‘ASingle Queue with Mutually Repacing m Servers’, Revista Columbiana de Estadistica, [Columbia, South America], Vol. 22, No. 1, pp 1-8.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1997) : ‘Correlated Selection for Service in a Single Server Queue with Two Classes of Customers’, Internat. J. Management and Information Sciences, [Republic of China], Vol. 8, No. 4, pp 1-10.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1996) : ‘On a Vacation Queue with Instantaneous Customer Loss’, Microelectronics and Reliability, [England], Vol. 36, No. 2, pp 179- 188.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1996) : ‘A single Server Queue with Two Types of Units and Randomly Changing Priorities’, Acta Ciencia Indica, [India], Vol. XXI, part III, pp 299-305.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1995) : ‘A Bulk Input Queue with a Stand-by’, South Africa Statistical Journal, [South Africa], Vol. 29, No. 1, pp 1-7.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1995) : ‘On a Vacation Queue with Two parallel Servers Each Equipped with a Stand-By’, Revista Columbiana de Estadistica, [Columbia, South America], Nos. 29/30, pp 21-30.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. and Arora, M.S. (1994) : ‘On a M[x]/M[b]/l Queueing System with Correlated Server Vacations’, International Journal of Management and Information Sciences’ [Formerly, Tamkang Journal of Management Sciences], [Republic of China], Vol. 5, No.3, pp23-33.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1994) : ‘On a Queueing System with Random Failures and Delayed Repairs’, Journal of The Indian Statistical Association, [India], Vol. 32, pp 39-48.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1994) : ‘An M/G/l Queueing System with Additional Optional Service and No Waiting Capacity’, Microelectronics and Reliability, [England], Vol. 34, No. 3, pp 521-527.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1994) : ‘A Queueing System with Three Service Channels in Tandem and Two-Sided Arrivals’, Soochow Journal of Mathematics, [Republic of China], Vol. 20, No. 1, pp 11-19.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1993) : ‘Balking and Reneging in a Vacation Queueing Model’, Revista Columbiana de Estadistica, [Columbia, South America], Vol. 28, pp 1-11.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1992) : ‘An M/G/l Queueing System with Compulsory Server Vacations’, Trabajos de Investigacion Operativa, [Spain], Vol. 7, No. 1, pp 100-110.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1992) : ‘An a M/M/l Queueing System with Additional Optional Service in Batches’, IAPQR Transactions, Journal of the Indian Association of Productivity, Quality and Reliability, [India], Vol. 17, No. 1, pp 23-33.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1992) : ‘A Bulk Queueing System with Random Failures and two Phase Repairs’, Microelectronics and Reliability, [England], Vol. 32, No.5, pp 669-677.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1991) : ‘On a M[x]/M[b]/l Queueing System with General Vacation Times’, International Journal of Management and Information Sciences, [Republic of China], Vol. 2, No. 1, pp 51-60.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1991) : ‘A Queueing System with Two types of Failures and Priority for Vital repairs ‘, Journal of M.A.C.T., [India], Vol. 25,, pp 25-43.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1991) : ‘A Single Server Bulk Input Queue with Two Kinds of Service’, Acta Ciencia Indica, [India], Vol. XVII, M, 1, pp 25-32.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1990) : ‘A Two Server Queue with Correlated Availability of Services’, J. Indian Soc. Stat. Oper. Res., [India], Vol. XI, No. 1-4, pp 11-19.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1989) : ‘Time-Dependent Behaviour of a Single Channel Queu with Fluctuating Efficiency’, Tamkang Journal of Managment Sciences, [Republic of China], Vol. 10, No.2, pp 71-80.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1989) : ‘A Single Channel Queue with Bulk Service Subject to Interruptions’, Microelectronics and Reliability, [England], Vol. 29, No.5, pp 813-818.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1988) : ‘A Cyclic Queueing System with Three Servers and Optional Two-Way Feedback’, Microelectronics and Reliability, [England], Vol. 28, No.6, pp 873-875.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1976) : ‘Interrupted Service Queueing with Arrivals and Departures in Batches of Variable Size and General Repair Time Distribution’, Zeitschrift Mathematische Operationsforeschung und Statistiek Berlin, [Presently named as ‘Statistics’] [Germany], 7, Heft 1, S. pp. 139-149.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1975) : ‘On a Certain Type of Network of Queues’, Journal of Applied Probability, [England], Vol. 12, pp 195-200.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1973) : ‘A Priority Queueing System with Service Interrutions’, Statistica Neerlandica, [Netherlands], Vol. 27, No.3, pp 115-123.
      Research area: Mathematics (Queueing Theory)

 

1. 1. Madan, K.C. (1972) : ‘A Queueing System with Service Interruptions ‘, Revue Roumaine de Mathematiques Pure et Appliques, [Romania], Tome XVII , No.5, pp 741-755. Books, Chapters Published
      Research area: Mathematics (Queueing Theory)

 

1. 1. Chopra, S. D. and Madan, K. C., ‘Mathematics for Middle Schools’, Book II, Part II, National Council of Educational Research and Training, India, pp. 215-394, 1978. (Editors: Arora, Manmohan, S. and Mahendra Shanker)
      Research area: Mathematics (Queueing Theory)

 

1. 1. Chopra, S. D. and Madan, K. C., ‘Mathematics for Middle Schools’, Book III, Part II, National Council of Educational Research and Training, India, pp. 161- 326, 1979. (Editors: Gupta, R. P. and Mahendra Shanker
      Research area: Mathematics (Queueing Theory)

 

1. 1. Das, S. C., Dhall, G. D., and Madan, K. C., et al ‘A Textbook of Mathematics for Classes XI-XII’, Book V, National Council of Educational Research and Training, India, pp. 1-156, 1980. (Editor: Das, S. C.)
      Research area: Mathematics (Queueing Theory)

 

1. Contributed one chapter or provided assistance in editing the following books: ‘A Textbook for Middle Schools’, Book 1, Part 1, National Council of Educational Research and Training, India, 1978. ‘A Textbook for Secondary Schools’ Part II, National Council of Educational Research and Training, India, 1978. ‘A Textbook of Mathematics for Classes XI-XII’, Book 1, National Council of Educational Research and Training, India, 1979. ‘A Textbook of Mathematics for Classes XI-XIII’, Book 1, National Council of Educational Research and Training, India, 1979. ‘A Textbook of Mathematics for Classes XI-XII’, Book IV, National Council of Educational Research and Training, India, 1979.
   Research area: Mathematics (Queueing Theory)