Sujit Kumar Samanta
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sujit Kumar Samanta has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
- Kousik Das
Department of Mathematics, National Institute of Technology Raipur, Raipur, India
7 shared publications - Rakesh Nandi
National Institute of Technology
6 shared publications - Veena Goswami
School of Computer Applications, Kalinga Institute of Industrial Technology, Bhubaneswar, India
6 shared publications - Essaid Sabir
TELUQ, University of Quebec, Montreal, Canada
5 shared publications - Mohan L. Chaudhry
Department of Mathematics and Computer Science, Royal Military College of Canada, Kingston, ON K7K 7B4, Canada
5 shared publications Rachid El-Azouzi
University of Avignon
5 shared publications
Latest Publications
- 1 September 2026
- Published by Springer Nature in OPSEARCH
- p. 1-19
Analyzing a bulk service queue with general input and batch size dependent service: $GI/M_{n}^{Y}/1$- 1 September 2026
- Published by Springer Nature in OPSEARCH
- p. 1-19
Analyzing a bulk service queue with general input and batch size dependent service: $GI/M_{n}^{Y}/1$- Open Access
- 20 May 2026
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 60 (3) , 1439-1473
Performance analysis of an M / G /1 retrial G-queue with balking, optional service and general retrial policy
This study examines the steady-state dynamics of an M/G /1 retrial queue that incorpo- rates features such as balking, optional service, negative customer, and general retrial time under a constant retrial policy. The probability generating functions for the orbit length with server status are obtained using the supplementary variable technique at various time epochs. We further extract the orbit size probabilities from these generating functions using the roots method. Additionally, the tail distribution of the orbit length is also presented for different time epochs. We conduct a comprehensive cost analysis to minimize the overall system operation cost. Advanced metaheuristic techniques such as particle swarm optimization and genetic algorithm are employed to determine the optimal system parameters that minimize the total cost. The impact of various system parameters on performance measures is demonstrated through detailed numerical examples.
- 20 May 2026
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 60 (3) , 1439-1473
Open AccessPerformance analysis of an M / G /1 retrial G-queue with balking, optional service and general retrial policy
This study examines the steady-state dynamics of an M/G /1 retrial queue that incorpo- rates features such as balking, optional service, negative customer, and general retrial time under a constant retrial policy. The probability generating functions for the orbit length with server status are obtained using the supplementary variable technique at various time epochs. We further extract the orbit size probabilities from these generating functions using the roots method. Additionally, the tail distribution of the orbit length is also presented for different time epochs. We conduct a comprehensive cost analysis to minimize the overall system operation cost. Advanced metaheuristic techniques such as particle swarm optimization and genetic algorithm are employed to determine the optimal system parameters that minimize the total cost. The impact of various system parameters on performance measures is demonstrated through detailed numerical examples.
- 21 March 2026
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 28 (2) , 29
Analysis of System Length and Waiting Time Distributions in BMAP/G/1 Queue Using Characteristic Roots
- 21 March 2026
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 28 (2) , 29
Analysis of System Length and Waiting Time Distributions in BMAP/G/1 Queue Using Characteristic Roots
- 20 February 2026
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 246, 591-620
Analytical and simulation studies of GI/M/1 queue integrated with an (s,Q) inventory policy
- 20 February 2026
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 246, 591-620
Analytical and simulation studies of GI/M/1 queue integrated with an (s,Q) inventory policy
- 27 November 2025
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 102 (2-3) , 359-393
A simple procedure to determine the queue length and waiting time distributions for $M/G^{a,b}/1$ queueing system- 27 November 2025
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 102 (2-3) , 359-393
A simple procedure to determine the queue length and waiting time distributions for $M/G^{a,b}/1$ queueing system- 21 August 2025
- Published by Springer Nature in OPSEARCH
- p. 1-33
Analytical study of two-way communication in M/G/1 retrial queue with constant retrial policy
- 21 August 2025
- Published by Springer Nature in OPSEARCH
- p. 1-33
Analytical study of two-way communication in M/G/1 retrial queue with constant retrial policy
- 27 June 2025
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 27 (3) , 1-28
Discrete-Time Geo/Geo/1 Queueing System Associated with (s, S) Inventory Policy
- 27 June 2025
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 27 (3) , 1-28
Discrete-Time Geo/Geo/1 Queueing System Associated with (s, S) Inventory Policy
- 12 February 2025
- Published by Taylor & Francis in Quality Technology & Quantitative Management
- Vol. 22 (6) , 1168-1195
Analytical and computational aspects of a batch arrival retrial queue with a constant retrial policy
- 12 February 2025
- Published by Taylor & Francis in Quality Technology & Quantitative Management
- Vol. 22 (6) , 1168-1195
Analytical and computational aspects of a batch arrival retrial queue with a constant retrial policy
- Open Access
- 21 November 2024
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 58 (6) , 4927-4954
A study on N-policy BMAP/G/1 queueing system
This study presents a simple approach for analyzing the BMAP/G/1 queueing system under N policy. In this policy, the server goes idle at the end of a busy period and the queue length is checked at every arrival moment. The idle server starts serving customers when the queue length reaches or above a predetermined number, namely N, and keeps doing so until the system is completely empty. We first use a simple sequential substitution approach to derive the system length distribution at departure epoch. A comparative study is also conducted to highlight the benefits and strength of our straightforward approach to that of the RG-factorization technique and the roots finding method. We extract the distribution of system length at a random time point by utilizing the remaining service time of a customer who is currently being served as the supplementary variable. The probability density function of the sojourn time distribution for an arbitrary customer of an incoming batch is also computed. We propose an expected linear cost function to estimate the optimal value of N at minimum cost. The validity of our analytic technique has been shown through a variety of numerical examples involving different service time distributions.
- 21 November 2024
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 58 (6) , 4927-4954
Open AccessA study on N-policy BMAP/G/1 queueing system
This study presents a simple approach for analyzing the BMAP/G/1 queueing system under N policy. In this policy, the server goes idle at the end of a busy period and the queue length is checked at every arrival moment. The idle server starts serving customers when the queue length reaches or above a predetermined number, namely N, and keeps doing so until the system is completely empty. We first use a simple sequential substitution approach to derive the system length distribution at departure epoch. A comparative study is also conducted to highlight the benefits and strength of our straightforward approach to that of the RG-factorization technique and the roots finding method. We extract the distribution of system length at a random time point by utilizing the remaining service time of a customer who is currently being served as the supplementary variable. The probability density function of the sojourn time distribution for an arbitrary customer of an incoming batch is also computed. We propose an expected linear cost function to estimate the optimal value of N at minimum cost. The validity of our analytic technique has been shown through a variety of numerical examples involving different service time distributions.