Yinghui Tang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yinghui Tang has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Miaomiao Yu
Sichuan University of Science and Engineering
4 shared publications - Jiang Cheng
School of Mathematics &Software Science, Sichuan Normal University, 610066 Chengdu, Sichuan, China
3 shared publications Miaomiao Yu
School of Mathematics & Software Science, Sichuan Normal University, Chengdu, Sichuan 610066, China
3 shared publications- Shaojun Lan
School of Mathematics and Statistics, Sichuan University of Science and Engineering, Zigong, China
3 shared publications Cailiang Li
Chengdu Electro-Mechanical College
2 shared publications- Chuan-Yi Luo
Southwestern University of Finance and Economics
2 shared publications
Latest Publications
- 12 December 2017
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 30 (6) , 1382-1402
The structure of departure process and optimal control strategy N* for Geo/G/1 discrete-time queue with multiple server vacations and Min(N, V)-Policy
- 12 December 2017
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 30 (6) , 1382-1402
The structure of departure process and optimal control strategy N* for Geo/G/1 discrete-time queue with multiple server vacations and Min(N, V)-Policy
- 9 February 2017
- Published by Springer Nature in Operational Research
- Vol. 19 (2) , 479-500
The improvement upon the reliability of the k-out-of-n:F system with the repair rates differentiation policy
- 9 February 2017
- Published by Springer Nature in Operational Research
- Vol. 19 (2) , 479-500
The improvement upon the reliability of the k-out-of-n:F system with the repair rates differentiation policy
- 15 December 2016
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 51 (1) , 101-122
Analysis ofD-policy discrete-timeGeo/G/1queue with secondJ-optional service and unreliable server
This paper is concerned with a discrete-time Geo/G/ 1 queueing system with D-policy and J-optional services in which the service station may be subject to failures at random during serving the customers. All the arriving customers require the first essential service, whereas some of them may opt for a second service from the J additional services with some probability. As soon as the system becomes empty, the server will not restart the service until the sum of the service times of the waiting customers in the system reaches or exceeds some given positive integer D. Applying the total probability decomposition law, renewal theory, and probability generating function technique, the queueing indices and reliability measures are investigated simultaneously in our work. Both the probability generating function of the transient queue length distribution and the explicit formulas of the steady-state queue length distribution at time epoch n + are derived. Meanwhile, the stochastic decomposition property is presented for the proposed model. Various reliability indices, including the transient and steady-state unavailability, the expected number of breakdowns during (0+,n + ], and the equilibrium failure frequency, are discussed. Finally, the optimum value of D for minimizing the system cost is numerically discussed under a given cost structure.
- 15 December 2016
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 51 (1) , 101-122
Analysis ofD-policy discrete-timeGeo/G/1queue with secondJ-optional service and unreliable server
This paper is concerned with a discrete-time Geo/G/ 1 queueing system with D-policy and J-optional services in which the service station may be subject to failures at random during serving the customers. All the arriving customers require the first essential service, whereas some of them may opt for a second service from the J additional services with some probability. As soon as the system becomes empty, the server will not restart the service until the sum of the service times of the waiting customers in the system reaches or exceeds some given positive integer D. Applying the total probability decomposition law, renewal theory, and probability generating function technique, the queueing indices and reliability measures are investigated simultaneously in our work. Both the probability generating function of the transient queue length distribution and the explicit formulas of the steady-state queue length distribution at time epoch n + are derived. Meanwhile, the stochastic decomposition property is presented for the proposed model. Various reliability indices, including the transient and steady-state unavailability, the expected number of breakdowns during (0+,n + ], and the equilibrium failure frequency, are discussed. Finally, the optimum value of D for minimizing the system cost is numerically discussed under a given cost structure.
- 1 February 2016
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 53 (1-2) , 657-681
Analysis of a discrete-time $Geo^{\lambda _1,\lambda _2}/G/1$ G e o λ 1 , λ 2 / G / 1 queue with N-policy and D-policy- 1 February 2016
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 53 (1-2) , 657-681
Analysis of a discrete-time $Geo^{\lambda _1,\lambda _2}/G/1$ G e o λ 1 , λ 2 / G / 1 queue with N-policy and D-policy- Open Access
- 1 January 2016
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 12 (4) , 1435-1464
System capacity optimization design and optimal threshold $N^{*}$ for a $GEO/G/1$ discrete-time queue with single server vacation and under the control of Min($N, V$)-policy- 1 January 2016
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 12 (4) , 1435-1464
Open AccessSystem capacity optimization design and optimal threshold $N^{*}$ for a $GEO/G/1$ discrete-time queue with single server vacation and under the control of Min($N, V$)-policy - Open Access
- 1 April 2015
- Published by MDPI AG in Mathematical and Computational Applications
- Vol. 20 (1) , 39-49
Analysis of an M (λ1,λ2) / M /1 / WV Queue with Controlled Vacation Interruption and Variable Arrival Rate
This paper studies a Markovian queue with multiple working vacations and controlled vacation interruption. If there are at least N customers waiting upon completion of a service at a lower rate, the vacation is interrupted and the server returns to the system to resume the normal working level. Otherwise, the server continues the vacation until the system is non-empty after a vacation ends or there are at least N customers after a service ends. Moreover, the variable arrival rate of the customers is taken into account. Under such assumptions, by using the quasi-birth-and-death process, the matrix- geometric method and the difference equation theory, the steady-state queue length distribution along with various performance measures are derived. Additionally, under a certain cost structure, the optimal threshold N* that minimizes the long-run expected cost function per unit time is numerically determined.
- 1 April 2015
- Published by MDPI AG in Mathematical and Computational Applications
- Vol. 20 (1) , 39-49
Open AccessAnalysis of an M (λ1,λ2) / M /1 / WV Queue with Controlled Vacation Interruption and Variable Arrival Rate
This paper studies a Markovian queue with multiple working vacations and controlled vacation interruption. If there are at least N customers waiting upon completion of a service at a lower rate, the vacation is interrupted and the server returns to the system to resume the normal working level. Otherwise, the server continues the vacation until the system is non-empty after a vacation ends or there are at least N customers after a service ends. Moreover, the variable arrival rate of the customers is taken into account. Under such assumptions, by using the quasi-birth-and-death process, the matrix- geometric method and the difference equation theory, the steady-state queue length distribution along with various performance measures are derived. Additionally, under a certain cost structure, the optimal threshold N* that minimizes the long-run expected cost function per unit time is numerically determined.
- 27 March 2015
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 49 (4) , 717-734
Computation and profit analysis of ak-out-of-n:Grepairable system underN-policy with multiple vacations and one replaceable repair facility
This paper considers a k-out-of-n:G system with N-policy and one repairman who takes multiple vacations, in which the operating times and repair times of components are governed by exponential distributions. Once an operating component breaks down, it is repaired by a repair facility. Moreover, the repair facility is subject to failure during the repair period which results in repair interruptions. Failed repair facility resumes repair after a random period of time. Under such assumptions, applying the quasi-birth-and-death process and the matrix-analytical approach, the system state probabilities are derived. In addition, various steady-state system performance measures such as the availability and the rate of occurrence of failure along with some numerical illustrations are reported. Finally, under a profit structure, we use the direct search method and the parabolic method to search for the optimal system parameters.
- 27 March 2015
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 49 (4) , 717-734
Computation and profit analysis of ak-out-of-n:Grepairable system underN-policy with multiple vacations and one replaceable repair facility
This paper considers a k-out-of-n:G system with N-policy and one repairman who takes multiple vacations, in which the operating times and repair times of components are governed by exponential distributions. Once an operating component breaks down, it is repaired by a repair facility. Moreover, the repair facility is subject to failure during the repair period which results in repair interruptions. Failed repair facility resumes repair after a random period of time. Under such assumptions, applying the quasi-birth-and-death process and the matrix-analytical approach, the system state probabilities are derived. In addition, various steady-state system performance measures such as the availability and the rate of occurrence of failure along with some numerical illustrations are reported. Finally, under a profit structure, we use the direct search method and the parabolic method to search for the optimal system parameters.
- Open Access
- 1 January 2015
- Published by Wiley in Discrete Dynamics in Nature and Society
- Vol. 2015, 1-13
Transient Analysis of a-out-of-System with-Policy, Repairmen’s Multiple Vacations, and Redundant DependencyThis paper analyzes a-out-of-:repairable system with-policy, repairmen’s multiple synchronous vacations, and redundant dependency. When there is no failed component in the system, the repairmen leave for a vacation, the duration of which follows a phase type distribution. Upon returning from vacation, they should take another vacation if there are less thanfailed components waiting in the system. This pattern continues until at leastfailed components are waiting. Moreover, the redundant dependency which is a special kind of failure dependency is taken into account in the multicomponent system. Under such assumptions, the availability, the rate of occurrence of failures, and the reliability of the system are derived in transient regime by applying the quasi-birth-and-death process. Furthermore, the Runge-Kutta method is carried out to numerically discuss the time-dependent behavior of the system reliability measures. Finally, a special case of the system is presented to show the validity of our model.- 1 January 2015
- Published by Wiley in Discrete Dynamics in Nature and Society
- Vol. 2015, 1-13
Open AccessTransient Analysis of a-out-of-System with-Policy, Repairmen’s Multiple Vacations, and Redundant DependencyThis paper analyzes a-out-of-:repairable system with-policy, repairmen’s multiple synchronous vacations, and redundant dependency. When there is no failed component in the system, the repairmen leave for a vacation, the duration of which follows a phase type distribution. Upon returning from vacation, they should take another vacation if there are less thanfailed components waiting in the system. This pattern continues until at leastfailed components are waiting. Moreover, the redundant dependency which is a special kind of failure dependency is taken into account in the multicomponent system. Under such assumptions, the availability, the rate of occurrence of failures, and the reliability of the system are derived in transient regime by applying the quasi-birth-and-death process. Furthermore, the Runge-Kutta method is carried out to numerically discuss the time-dependent behavior of the system reliability measures. Finally, a special case of the system is presented to show the validity of our model. - Open Access
- 1 August 2014
- Published by MDPI AG in Mathematical and Computational Applications
- Vol. 19 (2) , 105-114
Reliability Analysis of M/G/1 Repairable Queueing System with Multiple Adaptive Vacations and p-Entering Discipline
This paper considers the reliability of an M/G/1 queue with multiple adaptive vacations in which the arriving customers enter the system with probability p (0<p≤1) during vacations. Through appropriate assumptions, the model is studied by the total probability decomposition technique and the tool of Laplace transform. Some reliability indices are studied. Moreover, we give some numerical examples to observe the effect of various parameters on the reliability indices.
- 1 August 2014
- Published by MDPI AG in Mathematical and Computational Applications
- Vol. 19 (2) , 105-114
Open AccessReliability Analysis of M/G/1 Repairable Queueing System with Multiple Adaptive Vacations and p-Entering Discipline
This paper considers the reliability of an M/G/1 queue with multiple adaptive vacations in which the arriving customers enter the system with probability p (0<p≤1) during vacations. Through appropriate assumptions, the model is studied by the total probability decomposition technique and the tool of Laplace transform. Some reliability indices are studied. Moreover, we give some numerical examples to observe the effect of various parameters on the reliability indices.
- Open Access
- 17 June 2013
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2013, 1-11
A Novel Analytic Technique for the Service Station Reliability in a Discrete-Time Repairable Queue
This paper presents a decomposition technique for the service station reliability in a discrete-time repairable/G/1 queueing system, in which the server takes exhaustive service and multiple adaptive delayed vacation discipline. Using such a novel analytic technique, some important reliability indices and reliability relation equations of the service station are derived. Furthermore, the structures of the service station indices are also found. Finally, special cases and numerical examples validate the derived results and show that our analytic technique is applicable to reliability analysis of some complex discrete-time repairable bulk arrival queueing systems.- 17 June 2013
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2013, 1-11
Open AccessA Novel Analytic Technique for the Service Station Reliability in a Discrete-Time Repairable Queue
This paper presents a decomposition technique for the service station reliability in a discrete-time repairable/G/1 queueing system, in which the server takes exhaustive service and multiple adaptive delayed vacation discipline. Using such a novel analytic technique, some important reliability indices and reliability relation equations of the service station are derived. Furthermore, the structures of the service station indices are also found. Finally, special cases and numerical examples validate the derived results and show that our analytic technique is applicable to reliability analysis of some complex discrete-time repairable bulk arrival queueing systems.