Jianjun Li
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
Jianjun Li has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Li-Wei Liu
Department of Business Administration, College of Management, Chaoyang University of Technology, Taichung 413310, Taiwan
2 shared publications Liwei Liu
School of Science, Nanjing University of Science and Technology, Nanjing 210094, P.R. China
2 shared publications- Junshan Li
Chengdu University
1 shared publication - Liwei Liu
School of Science, Dalian Jiaotong University, Dalian 116028, China
1 shared publication - Lixue Guo
Department of Entomology, Nanjing Agricultural University, Nanjing, China
1 shared publication - Qingzhe Xu
School of Mathematics and Statistics, Nanjing University of Science and Technology, Nanjing, China
1 shared publication
Latest Publications
- 28 October 2024
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 26 (4) , 1-22
A Queueing-Inventory System with Modified Delayed Vacation under Bernoulli Schedule
- 28 October 2024
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 26 (4) , 1-22
A Queueing-Inventory System with Modified Delayed Vacation under Bernoulli Schedule
- 7 February 2022
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 11 (3) , 627-656
The GI/M/1 Queue in a Multi-phase Service Environment with Working Vacations and Bernoulli Vacation Interruption
- 7 February 2022
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 11 (3) , 627-656
The GI/M/1 Queue in a Multi-phase Service Environment with Working Vacations and Bernoulli Vacation Interruption
- 31 December 2019
- Published by Columbia University Press
- p. 161-184
6. Blockchain Finance and Virtual Currencies
6. Blockchain Finance and Virtual Currencies was published in China's Fintech Explosion on page 161.
- 31 December 2019
- Published by Columbia University Press
- p. 161-184
6. Blockchain Finance and Virtual Currencies
6. Blockchain Finance and Virtual Currencies was published in China's Fintech Explosion on page 161.
- 1 January 2018
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 52 (1) , 61-77
On an M/G/1 queue in random environment with Min(N, V) policy
In this paper, we analyze an M∕G∕1 queue operating in multi-phase random environment with Min(N, V) vacation policy. In operative phase i, i = 1, 2, …, n, customers are served according to the discipline of First Come First Served (FCFS). When the system becomes empty, the server takes a vacation under the Min(N, V) policy, causing the system to move to vacation phase 0. At the end of a vacation, if the server finds no customer waiting, another vacation begins. Otherwise, the system jumps from the phase 0 to some operative phase i with probability qi, i = 1, 2, …, n. And whenever the number of the waiting customers in the system reaches N, the server interrupts its vacation immediately and the system jumps from the phase 0 to some operative phase i with probability qi, i = 1, 2, …, n, too. Using the method of supplementary variable, we derive the distribution for the stationary system size at arbitrary epoch. We also obtain mean system size, the results of the cycle analysis and the sojourn time distribution. In addition, some special cases and numerical examples are presented.
- 1 January 2018
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 52 (1) , 61-77
On an M/G/1 queue in random environment with Min(N, V) policy
In this paper, we analyze an M∕G∕1 queue operating in multi-phase random environment with Min(N, V) vacation policy. In operative phase i, i = 1, 2, …, n, customers are served according to the discipline of First Come First Served (FCFS). When the system becomes empty, the server takes a vacation under the Min(N, V) policy, causing the system to move to vacation phase 0. At the end of a vacation, if the server finds no customer waiting, another vacation begins. Otherwise, the system jumps from the phase 0 to some operative phase i with probability qi, i = 1, 2, …, n. And whenever the number of the waiting customers in the system reaches N, the server interrupts its vacation immediately and the system jumps from the phase 0 to some operative phase i with probability qi, i = 1, 2, …, n, too. Using the method of supplementary variable, we derive the distribution for the stationary system size at arbitrary epoch. We also obtain mean system size, the results of the cycle analysis and the sojourn time distribution. In addition, some special cases and numerical examples are presented.
- Open Access
- 1 January 2017
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2017 (1)
On the GI/M/1 Queue with Vacations and Multiple Service Phases
This paper considers a GI/M/1 queue with vacations and multiple service phases. Whenever the system becomes empty, the server takes a vacation, causing the system to move to vacation phase 0. If the server returns from a vacation to find no customer waiting, another vacation begins. Otherwise, the system jumps from phase 0 to some service phase i with probability qi, i = 1,2, …, N. Using the matrix geometric solution method and semi‐Markov process, we obtain the distributions of the stationary system size at both arrival and arbitrary epochs. The distribution of the stationary waiting time of an arbitrary customer is also derived. In addition, we present some performance measures such as mean waiting time of an arbitrary customer, mean length of the type‐i cycle, and mean number of customers in the system at the end of phase 0. Finally, some numerical examples are presented.
- 1 January 2017
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2017 (1)
Open AccessOn the GI/M/1 Queue with Vacations and Multiple Service Phases
This paper considers a GI/M/1 queue with vacations and multiple service phases. Whenever the system becomes empty, the server takes a vacation, causing the system to move to vacation phase 0. If the server returns from a vacation to find no customer waiting, another vacation begins. Otherwise, the system jumps from phase 0 to some service phase i with probability qi, i = 1,2, …, N. Using the matrix geometric solution method and semi‐Markov process, we obtain the distributions of the stationary system size at both arrival and arbitrary epochs. The distribution of the stationary waiting time of an arbitrary customer is also derived. In addition, we present some performance measures such as mean waiting time of an arbitrary customer, mean length of the type‐i cycle, and mean number of customers in the system at the end of phase 0. Finally, some numerical examples are presented.
- Open Access
- 1 January 2016
- Published by Wiley in Discrete Dynamics in Nature and Society
- Vol. 2016 (1) , 1-9
On the Discrete‐Time Geo/G/1 Queue with Vacations in Random Environment
A discrete‐time Geo/G/1 queue with vacations in random environment is analyzed. Using the method of supplementary variable, we give the probability generating function (PGF) of the stationary queue length distribution at arbitrary epoch. The PGF of the stationary sojourn time distribution is also derived. And we present the various performance measures such as mean number of customers in the system, mean length of the type‐i cycle, and mean time that the system resides in phase 0. In addition, we show that the M/G/1 queue with vacations in random environment can be approximated by its discrete‐time counterpart. Finally, we present some special cases of the model and numerical examples.
- 1 January 2016
- Published by Wiley in Discrete Dynamics in Nature and Society
- Vol. 2016 (1) , 1-9
Open AccessOn the Discrete‐Time Geo/G/1 Queue with Vacations in Random Environment
A discrete‐time Geo/G/1 queue with vacations in random environment is analyzed. Using the method of supplementary variable, we give the probability generating function (PGF) of the stationary queue length distribution at arbitrary epoch. The PGF of the stationary sojourn time distribution is also derived. And we present the various performance measures such as mean number of customers in the system, mean length of the type‐i cycle, and mean time that the system resides in phase 0. In addition, we show that the M/G/1 queue with vacations in random environment can be approximated by its discrete‐time counterpart. Finally, we present some special cases of the model and numerical examples.