1U. C. Gupta, A. D. Banik and S. S. Pathak, Complete analysis of MAP/G/1/N queue with single (multiple) vacation(s) under limited service discipline, Journal of Applied Mathematics and Stochastic Analysis 2005 (3) 353-373.
2A. D. Banik, U. C. Gupta and S. S. Pathak, Finite buffer vacation models under E-limited with limit variation service and Markovian arrival process, Operations Research Letters 34 (5) 539-547
3A. D. Banik, U. C. Gupta and S. S. Pathak, BMAP/G/1/N queue with vacations and limited service discipline, Applied Mathematics and Computation 180 (2) 707-721.
4U. C. Gupta and A. D. Banik, Complete analysis of finite and infinite buffer GI/MSP/1 queue-a computational approach, Operations Research Letters 35 (2) 273-280.
5A. D. Banik, U. C. Gupta and S. S. Pathak, On the GI/M/1/N queue with multiple working vacations-analytic analysis and computation, Applied Mathematical Modelling 31(9)1701-1710.
6A. D. Banik, M. L. Chaudhry 2016. Efficient Computational Analysis of Stationary
Probabilities for the Queueing System BMAP/G/1/N With or Without Vacation(s). INFORMS Journal on Computing, 29(1), 140–151.
7Souvik Ghosh, A. D. Banik 2017. An algorithmic analysis of the BMAP/MSP/1 generalized processor-sharing queue. Computers & Operations Research 79, 1–11.
8Gopinath Panda, Veena Goswami, A. D. Banik 2016. Equilibrium and Socially Optimal Balking Strategies in Markovian Queues with Vacations and Sequential Abandonment. Asia-Pacific Journal of Operational Research 33(05), 34 Pages.
9Gopinath Panda, A.D. Banik & M.L. Chaudhry 2017. Stationary distributions of the R[X]/R/1 cross-correlated queue. Communication in Statistics-Theory and Methods. (Article in Press)
10Dibyajyoti Guha, Veena Goswami, A. D. Banik 2015. Equilibrium balking strategies in renewal input batch arrival queues with multiple and single working vacation. Performance Evaluation 94, 1—24.
11Dibyajyoti Guha, Veena Goswami, A. D. Banik, 2016. Algorithmic computation of steady-state probabilities in an almost observable GI/M/c queue with or without vacations under state dependent balking and reneging. Applied Mathematical Modelling 40, 4199–4219.
12ML Chaudhry, AD Banik, A Pacheco, 2015. A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: GI^{[X]}/C-MSP/1/∞. Annals of Operations Research. (Article in Press)
13Chaudhry M. L., A. D. Banik, A. Pacheco, Souvik Ghosh, 2016. A Simple Analysis of system characteristics in the Batch Service Queue with Infinite-buffer and Markovian Service Process using the Roots Method: GI/C-MSP(a,b)/1/∞. RAIRO Operations Research 50, 519—551.
14Gopinath Panda, Veena Goswami, A. D. Banik, Dibyajyoti Guha, 2016. Equilibrium balking strategies in renewal input queue with Bernoulli-schedule controlled vacation and vacation interruption, Journal of Industrial and Management Optimization. 12 (3), 851--878. ([Publisher: American Institute of Mathematical Sciences]
15A. D. Banik, 2015. Single server queues with batch Markovian arrival process and bulk renewal or non-renewal service. Journal of system science and systems engineering. 24, 337-363.
16A. D. Banik, 2017. Stationary Analysis of a BMAP/R/1 Queue with R-type Multiple Working Vacations. Communications in Statistics-Simulation and Computation. (Article in Press)
17A. D. Banik, 2014. Some aspects of stationary characteristics and optimal control of the BMAP∕ G− G∕ 1∕ N (∞) oscillating queueing system. Applied Stochastic Models in Business and Industry 31, 214-230.
18D. Guha and A. D. Banik 2013. On The Renewal Input Batch-arrival Queue Under Single And Multiple Working Vacation Policy With Application To EPON. INFOR: Information Systems and Operational Research 51 (4), 175-191.
19A. D. Banik, 2013. Analysis of Queue-Length Dependent Vacations and P-Limited Service in BMAP/G/1/N Systems: Stationary Distributions and Optimal Control. International Journal of Stochastic Analysis 2013, 14 Pages.
20A. D. Banik, 2013. Stationary distributions and optimal control of queues with batch Markovian arrival process under multiple adaptive vacations. Computers & Industrial Engineering 65 (3), 455-465.