Rakesh Nandi
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
Rakesh Nandi has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Sujit Kumar Samanta
Department of Mathematics, National Institute of Technology Raipur, Raipur, India
6 shared publications - Chesoong Kim
Sangji University
1 shared publication - Darryl Teo
Engineering Systems and Design, Aviation Studies Institute, Singapore University of Technology and Design, Singapore 487372, Singapore
1 shared publication Gengling Dai
1 shared publication- Nuno Antunes Ribeiro
Engineering Systems and Design, Aviation Studies Institute, Singapore University of Technology and Design, Singapore 487372, Singapore
1 shared publication - Peter Jackson
Engineering Systems and Design, Aviation Studies Institute, Singapore University of Technology and Design, Singapore 487372, Singapore
1 shared publication
Latest Publications
- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 17 (6) , 3603-3631
Analysis of $ D $-$ BMAP/G/1 $ queueing system under $ N $-policy and its cost optimizationThis article studies an infinite buffer single server queueing system under $ N $-policy in which customers arrive according to a discrete-time batch Markovian arrival process. The service times of customers are independent and obey a common general discrete distribution. The idle server begins to serve the customers as soon as the queue size becomes at least $ N $ and serves the customers until the system becomes empty. We determine the queue length distribution at post-departure epoch with the help of roots of the associated characteristic equation of the vector probability generating function. Using the supplementary variable technique, we develop the system of vector difference equations to derive the queue length distribution at random epoch. An analytically simple and computationally efficient approach is also presented to compute the waiting time distribution in the queue of a randomly selected customer of an arrival batch. We also construct an expected linear cost function to determine the optimal value of $ N $ at minimum cost. Some numerical results are demonstrated for different service time distributions through the optimal control parameter to show the key performance measures.- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 17 (6) , 3603-3631
Analysis of $ D $-$ BMAP/G/1 $ queueing system under $ N $-policy and its cost optimizationThis article studies an infinite buffer single server queueing system under $ N $-policy in which customers arrive according to a discrete-time batch Markovian arrival process. The service times of customers are independent and obey a common general discrete distribution. The idle server begins to serve the customers as soon as the queue size becomes at least $ N $ and serves the customers until the system becomes empty. We determine the queue length distribution at post-departure epoch with the help of roots of the associated characteristic equation of the vector probability generating function. Using the supplementary variable technique, we develop the system of vector difference equations to derive the queue length distribution at random epoch. An analytically simple and computationally efficient approach is also presented to compute the waiting time distribution in the queue of a randomly selected customer of an arrival batch. We also construct an expected linear cost function to determine the optimal value of $ N $ at minimum cost. Some numerical results are demonstrated for different service time distributions through the optimal control parameter to show the key performance measures.- Open Access
- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 17 (2) , 549-573
Analysis of $GI^{[X]}/D$-$MSP/1/\infty$ queue using $RG$-factorizationThis paper analyzes an infinite-buffer single-server queueing system wherein customers arrive in batches of random size according to a discrete-time renewal process. The customers are served one at a time under discrete-time Markovian service process. Based on the censoring technique, the UL-type$ RG $ -factorization for the Toeplitz type block-structured Markov chain is used to obtain the prearrival epoch probabilities. The random epoch probabilities are obtained with the help of classical principle based on Markov renewal theory. The system-length distributions at outside observer's, intermediate and post-departure epochs are obtained by making relations among various time epochs. The analysis of waiting-time distribution measured in slots of an arbitrary customer in an arrival batch has also been investigated. In order to unify the results of both discrete-time and its continuous-time counterpart, we give a brief demonstration to get the continuous-time results from those of the discrete-time ones. A variety of numerical results are provided to illustrate the effect of model parameters on the performance measures.- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 17 (2) , 549-573
Open AccessAnalysis of $GI^{[X]}/D$-$MSP/1/\infty$ queue using $RG$-factorizationThis paper analyzes an infinite-buffer single-server queueing system wherein customers arrive in batches of random size according to a discrete-time renewal process. The customers are served one at a time under discrete-time Markovian service process. Based on the censoring technique, the UL-type$ RG $ -factorization for the Toeplitz type block-structured Markov chain is used to obtain the prearrival epoch probabilities. The random epoch probabilities are obtained with the help of classical principle based on Markov renewal theory. The system-length distributions at outside observer's, intermediate and post-departure epochs are obtained by making relations among various time epochs. The analysis of waiting-time distribution measured in slots of an arbitrary customer in an arrival batch has also been investigated. In order to unify the results of both discrete-time and its continuous-time counterpart, we give a brief demonstration to get the continuous-time results from those of the discrete-time ones. A variety of numerical results are provided to illustrate the effect of model parameters on the performance measures. - 29 September 2020
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 23 (4) , 1461-1488
Queue-Length, Waiting-Time and Service Batch Size Analysis for the Discrete-Time GI/D-MSP$^{\text {(a,b)}}/1/\infty $ Queueing System
- 29 September 2020
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 23 (4) , 1461-1488
Queue-Length, Waiting-Time and Service Batch Size Analysis for the Discrete-Time GI/D-MSP$^{\text {(a,b)}}/1/\infty $ Queueing System
- 16 June 2020
- Published by Taylor & Francis in American Journal of Mathematical and Management Sciences
- Vol. 39 (4) , 362-382
Stationary Analysis of an Infinite-Buffer D-MAP/D-MSP/1 Queueing System
This paper deals with the analysis of an infinite-buffer single-server D-MAP/D-MSP/1 queueing system. This queueing system can be analyzed by representing level-independent quasi-birth-and-death process in tridiagonal structure. The proposed analysis is based on the use of matrix-geometric method in conjunction with the spectral method to obtain the system-length distribution at outside observer’s epoch. We derive the stationary system-length distributions at random, prearrival, intermediate and post-departure epochs using the system-length distribution at outside observer’s epoch. The waiting-time distribution in the queue measured in slots of an arriving customer is also carried out. Computational procedures along with numerical results are provided to confirm the correctness of our analytical results.
- 16 June 2020
- Published by Taylor & Francis in American Journal of Mathematical and Management Sciences
- Vol. 39 (4) , 362-382
Stationary Analysis of an Infinite-Buffer D-MAP/D-MSP/1 Queueing System
This paper deals with the analysis of an infinite-buffer single-server D-MAP/D-MSP/1 queueing system. This queueing system can be analyzed by representing level-independent quasi-birth-and-death process in tridiagonal structure. The proposed analysis is based on the use of matrix-geometric method in conjunction with the spectral method to obtain the system-length distribution at outside observer’s epoch. We derive the stationary system-length distributions at random, prearrival, intermediate and post-departure epochs using the system-length distribution at outside observer’s epoch. The waiting-time distribution in the queue measured in slots of an arriving customer is also carried out. Computational procedures along with numerical results are provided to confirm the correctness of our analytical results.
- 23 September 2019
- Published by Taylor & Francis in Quality Technology & Quantitative Management
- Vol. 17 (4) , 399-422
Performance analysis of the GI/D-MSP/1 queue with N-policy and its optimal control
This paper investigates a discrete-time GI/D-MSP/1/\infty queueing system under N-policy with renewal input. The service process is correlated and its structure is constructed through discrete-time Markovian service process. The idle server resumes to serve the customers as soon as the number of waiting customers in the queue reaches a predefined threshold value N and serves the customers exhaustively until the system becomes empty. We use the matrix-geometric method to derive the system-length distribution at prearrival epoch. Employing the Markov renewal theory, we obtain the system-length distribution at random epoch. We also carried out the system-length distributions at outside observer’s, intermediate and post-departure epochs. Further, we find the waiting-time distribution in the queue measured in slots of an arrival customer. An expected linear cost function per unit time is considered to determine the optimal value of N, which minimises the expected cost function. Some numerical results are demonstrated to measure the effects of N, interarrival-time distributions and other model parameters.
- 23 September 2019
- Published by Taylor & Francis in Quality Technology & Quantitative Management
- Vol. 17 (4) , 399-422
Performance analysis of the GI/D-MSP/1 queue with N-policy and its optimal control
This paper investigates a discrete-time GI/D-MSP/1/\infty queueing system under N-policy with renewal input. The service process is correlated and its structure is constructed through discrete-time Markovian service process. The idle server resumes to serve the customers as soon as the number of waiting customers in the queue reaches a predefined threshold value N and serves the customers exhaustively until the system becomes empty. We use the matrix-geometric method to derive the system-length distribution at prearrival epoch. Employing the Markov renewal theory, we obtain the system-length distribution at random epoch. We also carried out the system-length distributions at outside observer’s, intermediate and post-departure epochs. Further, we find the waiting-time distribution in the queue measured in slots of an arrival customer. An expected linear cost function per unit time is considered to determine the optimal value of N, which minimises the expected cost function. Some numerical results are demonstrated to measure the effects of N, interarrival-time distributions and other model parameters.
- 23 February 2019
- Published by Springer Nature in OPSEARCH
- Vol. 56 (1) , 216-241
Performance analysis of a GI/D- $MSP/1/\infty$ M S P / 1 / ∞ queueing system under different service phase initiations- 23 February 2019
- Published by Springer Nature in OPSEARCH
- Vol. 56 (1) , 216-241
Performance analysis of a GI/D- $MSP/1/\infty$ M S P / 1 / ∞ queueing system under different service phase initiations- 22 September 2018
- Published by Springer Nature in Journal of the Indian Society for Probability and Statistics
- Vol. 19 (2) , 455-468
Performance Analysis of Shock Models Governed by a Discrete-Time Markovian Arrival Process
- 22 September 2018
- Published by Springer Nature in Journal of the Indian Society for Probability and Statistics
- Vol. 19 (2) , 455-468
Performance Analysis of Shock Models Governed by a Discrete-Time Markovian Arrival Process