Jianjun Li

Jianjun Li

Auto-generated profile, based on publicly available information

Jianjun Li

School of Mathematics and Statistics, Nanjing University of Science and Technology, Nanjing, China

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2018 in RAIRO - Operations Research
Verified
Journal Article
Closed access
JLJianjun Li
Jianjun Li
LLLiwei Liu
Liwei Liu
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 2016 in Discrete Dynamics in Nature and Society
Verified
Journal Article
Open access
PDF file
JLJianjun Li
Jianjun Li
立刘立伟 刘
立伟 刘
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.

28 October 2024 in Methodology and Computing in Applied Probability
Verified
Journal Article
Closed access
PDF file
QXQingzhe Xu
Qingzhe Xu
JLJianjun Li
Jianjun Li
LLLi-Wei Liu
Li-Wei Liu
LGLixue Guo
Lixue Guo

23 June 2018
Verified
Conference Paper
Open access
PDF file
Junshan LiJunshan Li
Junshan Li
JLJianjun Li
Jianjun Li

7 February 2022 in Journal of the Operations Research Society of China
Verified
Journal Article
Closed access
PDF file
JLJian-Jun Li
Jian-Jun Li
LLLi-Wei Liu
Li-Wei Liu

1 January 2017 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
JLJianjun Li
Jianjun Li
LLLiwei Liu
Liwei Liu
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.