Jau-Chuan Ke
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jau-Chuan Ke has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Tzu-Hsin Liu
Department of Finance, Chaoyang University of Technology, Taichung, Taiwan
3 shared publications Ching-Chang Kuo
Natl Taichung Univ Sci & Technol, Dept Appl Stat, Taichung, Taiwan
2 shared publications- Ching-Chang Kuo
National Taichung University of Science and Technology
2 shared publications Fu-Min Chang
Department of Finance, Chaoyang University of Technology, Taichung, Taiwan, ROC
2 shared publicationsTzu-Hsin Liu
Department of Finance, Chaoyang University of Technology, Taichung, Taiwan, ROC
2 shared publicationsChia Huang Wu
Department of Industrial Engineering and Management, National Chiao Tung University, Hsinchu, Taiwan
1 shared publication
Latest Publications
- Open Access
- 27 April 2023
- Published by MDPI AG in Computation
- Vol. 11 (5) , 89
Preemptive Priority Markovian Queue Subject to Server Breakdown with Imperfect Coverage and Working Vacation Interruption
This work considers a preemptive priority queueing system with vacation, where the single server may break down with imperfect coverage. Various combinations of server vacation priority queueing models have been studied by many scholars. A common assumption in these models is that the server will only resume its normal service rate after the vacation is over. However, such speculation is more limited in real-world situations. Hence, in this study, the vacation will be interrupted if a customer waits for service in the system at the moment of completion of service during vacation. The stationary probability distribution is derived by using the probability generating function approach. We also develop varieties of performance measures and provide a simple numerical example to illustrate these measures. Optimization analysis is finally carried out, including cost optimization and tri-object optimization.
- 27 April 2023
- Published by MDPI AG in Computation
- Vol. 11 (5) , 89
Open AccessPreemptive Priority Markovian Queue Subject to Server Breakdown with Imperfect Coverage and Working Vacation Interruption
This work considers a preemptive priority queueing system with vacation, where the single server may break down with imperfect coverage. Various combinations of server vacation priority queueing models have been studied by many scholars. A common assumption in these models is that the server will only resume its normal service rate after the vacation is over. However, such speculation is more limited in real-world situations. Hence, in this study, the vacation will be interrupted if a customer waits for service in the system at the moment of completion of service during vacation. The stationary probability distribution is derived by using the probability generating function approach. We also develop varieties of performance measures and provide a simple numerical example to illustrate these measures. Optimization analysis is finally carried out, including cost optimization and tri-object optimization.
- 17 January 2022
- Published by Taylor & Francis in Quality Technology & Quantitative Management
- Vol. 19 (4) , 428-453
Optimization of retrial queue with unreliable servers subject to imperfect coverage and reboot delay
A retrial queue with constant retrial policy, unreliable servers and the failed servers may not be detected is investigated in this paper. Upon arrival, a customer either is attended to one of the available servers or enters a retrial orbit and retries in a random time as all servers are not available. The unreliable server can be breakdown when he is working. The breakdown server may not be detected due to some fault matters. Under such a situation, the repair facility will issue a reboot operation to locate the non-detected breakdown server. Once the breakdown server is detected and located, he will be sent for repair. After utilizing the general theory of matrix-geometric approach to determine the stationary distribution, some performance measures are proposed. A single-objective model aiming at minimizing the average cost is constructed. We apply particle swarm optimization algorithm and genetic algorithm to find the optimum combination of parameters. We also formulate a bi-objective model aiming at minimizing the expect cost and the mean waiting time of customers in orbit. Two multi-objective algorithms are developed to solve it.
- 17 January 2022
- Published by Taylor & Francis in Quality Technology & Quantitative Management
- Vol. 19 (4) , 428-453
Optimization of retrial queue with unreliable servers subject to imperfect coverage and reboot delay
A retrial queue with constant retrial policy, unreliable servers and the failed servers may not be detected is investigated in this paper. Upon arrival, a customer either is attended to one of the available servers or enters a retrial orbit and retries in a random time as all servers are not available. The unreliable server can be breakdown when he is working. The breakdown server may not be detected due to some fault matters. Under such a situation, the repair facility will issue a reboot operation to locate the non-detected breakdown server. Once the breakdown server is detected and located, he will be sent for repair. After utilizing the general theory of matrix-geometric approach to determine the stationary distribution, some performance measures are proposed. A single-objective model aiming at minimizing the average cost is constructed. We apply particle swarm optimization algorithm and genetic algorithm to find the optimum combination of parameters. We also formulate a bi-objective model aiming at minimizing the expect cost and the mean waiting time of customers in orbit. Two multi-objective algorithms are developed to solve it.
- 2 March 2021
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 55, S1229-S1248
On the retrial queue with imperfect coverage and delay reboot
Retrial systems have been used extensively to model many practical problems in call center, data center, cloud service computing center and computer network system. This paper deals with a multi-server retrial system with the features of imperfect coverage and delay reboot. In the investigated system, arrivals may not be detected because of some fault issues. When this situation happened, the system is cleared by a reboot operation. Once arrivals are detected and located, they are attended to when a server is available; otherwise, they join a retrial orbit and generate repeated attempts till a free server is found. We analyze the presented model as a quasi-birth-and-death process and develop various performance indices. The optimal number of servers and optimal service rate are searched by constructing an average cost function. A heuristic search technique is employed to obtain the optimization approximate solution at a minimum cost. Numerical illustrations are given to demonstrate the optimization procedure and the effects of varying parameters on performance indices. We also present an application example to demonstrate the applicability of investigated model.
- 2 March 2021
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 55, S1229-S1248
On the retrial queue with imperfect coverage and delay reboot
Retrial systems have been used extensively to model many practical problems in call center, data center, cloud service computing center and computer network system. This paper deals with a multi-server retrial system with the features of imperfect coverage and delay reboot. In the investigated system, arrivals may not be detected because of some fault issues. When this situation happened, the system is cleared by a reboot operation. Once arrivals are detected and located, they are attended to when a server is available; otherwise, they join a retrial orbit and generate repeated attempts till a free server is found. We analyze the presented model as a quasi-birth-and-death process and develop various performance indices. The optimal number of servers and optimal service rate are searched by constructing an average cost function. A heuristic search technique is employed to obtain the optimization approximate solution at a minimum cost. Numerical illustrations are given to demonstrate the optimization procedure and the effects of varying parameters on performance indices. We also present an application example to demonstrate the applicability of investigated model.
- Open Access
- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 17 (3) , 1411-1422
Machine interference problem involving unsuccessful switchover for a group of repairable servers with vacations
The purpose of this paper is to explore the multiple-server machine interference problem with standby unsuccessful switchover and Bernoulli vacation schedule. Failure times of operating and standby machines are assumed to have exponential distributions and repair times of the failed machines and vacation times of servers are also assumed to have exponential distributions. After the completion of service, the server either goes for a vacation or may continue serving for the next machine. The vacation policy we considered is a single vacation policy. In practice, the switchover may experience a significant failure. The matrix analytical method and recursive method are employed to obtain the steady-state probability vectors, and closed-form expressions of some important system characteristics are obtained. The problem of cost optimization dealt with a number of numerical examples is provided by the Quasi-Newton method, the pattern search method, and the Nelder-Mead simplex direct search method. Expressions of various system characteristics are derived. Sensitivity analysis is performed numerically for system parameters. This paper presents the first time that machine interference problem with unsuccessful switchover for a group of repairable servers with vacations has been obtained, which is quite useful for the decision makers.
- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 17 (3) , 1411-1422
Open AccessMachine interference problem involving unsuccessful switchover for a group of repairable servers with vacations
The purpose of this paper is to explore the multiple-server machine interference problem with standby unsuccessful switchover and Bernoulli vacation schedule. Failure times of operating and standby machines are assumed to have exponential distributions and repair times of the failed machines and vacation times of servers are also assumed to have exponential distributions. After the completion of service, the server either goes for a vacation or may continue serving for the next machine. The vacation policy we considered is a single vacation policy. In practice, the switchover may experience a significant failure. The matrix analytical method and recursive method are employed to obtain the steady-state probability vectors, and closed-form expressions of some important system characteristics are obtained. The problem of cost optimization dealt with a number of numerical examples is provided by the Quasi-Newton method, the pattern search method, and the Nelder-Mead simplex direct search method. Expressions of various system characteristics are derived. Sensitivity analysis is performed numerically for system parameters. This paper presents the first time that machine interference problem with unsuccessful switchover for a group of repairable servers with vacations has been obtained, which is quite useful for the decision makers.
- 16 November 2017
- Published by Springer Nature in Soft Computing
- Vol. 23 (6) , 2073-2082
Modeling and comparison of the series systems with imperfect coverage for an unreliable server
- 16 November 2017
- Published by Springer Nature in Soft Computing
- Vol. 23 (6) , 2073-2082
Modeling and comparison of the series systems with imperfect coverage for an unreliable server
- 12 June 2017
- Published by Taylor & Francis in International Journal of Computer Mathematics: Computer Systems Theory
- Vol. 2 (3) , 81-96
Dynamic operating policy for the controllable queue with two removable unreliable servers
In this paper, we investigate an infinity capacity M/M/2 queueing system under a dynamic operating policy. In the system, there are two identical removable servers. Initially, these two servers are turned off. Once the number of customers in the system reaches the first/second start-up threshold, the first/second server is turned on. Similarly, once the number of customers in the system reduces to the second/first shut-down threshold, the second/first server will be turned off. When these two servers provide services to the customer, they are assumed to be unreliable and so may break down. If a server fails, it is immediately sent to the maintenance department. The probability-generating technique and matrix-geometric method are employed to obtain the steady-state results. The equilibrium condition of the system is explicitly developed. We further develop matrix-form expressions for various system characteristics. Finally, an optimization analysis is performed.
- 12 June 2017
- Published by Taylor & Francis in International Journal of Computer Mathematics: Computer Systems Theory
- Vol. 2 (3) , 81-96
Dynamic operating policy for the controllable queue with two removable unreliable servers
In this paper, we investigate an infinity capacity M/M/2 queueing system under a dynamic operating policy. In the system, there are two identical removable servers. Initially, these two servers are turned off. Once the number of customers in the system reaches the first/second start-up threshold, the first/second server is turned on. Similarly, once the number of customers in the system reduces to the second/first shut-down threshold, the second/first server will be turned off. When these two servers provide services to the customer, they are assumed to be unreliable and so may break down. If a server fails, it is immediately sent to the maintenance department. The probability-generating technique and matrix-geometric method are employed to obtain the steady-state results. The equilibrium condition of the system is explicitly developed. We further develop matrix-form expressions for various system characteristics. Finally, an optimization analysis is performed.
- 11 September 2015
- Published by Taylor & Francis in Communications in Statistics - Theory and Methods
- Vol. 45 (12) , 3637-3657
Analysis of a batch arrival queue with vacation policy and exceptional service
We consider the distributions of operating characteristics of an M[x]/G/1 queue under vacation policies, where the first customer of each busy period receives an exceptional service. When all the customers are served in the system exhaustively, the server deactivates and operates one of two vacation policies: (1) multiple vacation policy and (2) single vacation policy. We develop the performance measures for both systems. Finally, some numerical illustrations are also given. These two vacation models have potential applications in day-to-day life, such as post offices, banks, hospitals, etc.
- 11 September 2015
- Published by Taylor & Francis in Communications in Statistics - Theory and Methods
- Vol. 45 (12) , 3637-3657
Analysis of a batch arrival queue with vacation policy and exceptional service
We consider the distributions of operating characteristics of an M[x]/G/1 queue under vacation policies, where the first customer of each busy period receives an exceptional service. When all the customers are served in the system exhaustively, the server deactivates and operates one of two vacation policies: (1) multiple vacation policy and (2) single vacation policy. We develop the performance measures for both systems. Finally, some numerical illustrations are also given. These two vacation models have potential applications in day-to-day life, such as post offices, banks, hospitals, etc.
- Open Access
- 1 January 2014
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 10 (4) , 1191-1208
On the multi-server machine interference with modified Bernoulli vacation
We study the multi-server machine interference problem with repair pressure coefficient and a modified Bernoulli vacation. The repair rate depends on the number of failed machines waiting in the system. In congestion, the server may increase the repair rate with pressure coefficient $\theta$ to reduce the queue length. At each repair completion of a server, the server may go for a vacation of random length with probability $p$ or may continue to repair the next failed machine, if any, with probability $1-p$. The entire system is modeled as a finite-state Markov chain and its steady state distribution is obtained by a recursive matrix approach. The major performance measures are evaluated based on this distribution. Under a cost structure, we propose to use the Quasi-Newton method and probabilistic global search Lausanne method to search for the global optimal system parameters. Numerical examples are presented to demonstrate the application of our approach.- 1 January 2014
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 10 (4) , 1191-1208
Open AccessOn the multi-server machine interference with modified Bernoulli vacation
We study the multi-server machine interference problem with repair pressure coefficient and a modified Bernoulli vacation. The repair rate depends on the number of failed machines waiting in the system. In congestion, the server may increase the repair rate with pressure coefficient $\theta$ to reduce the queue length. At each repair completion of a server, the server may go for a vacation of random length with probability $p$ or may continue to repair the next failed machine, if any, with probability $1-p$. The entire system is modeled as a finite-state Markov chain and its steady state distribution is obtained by a recursive matrix approach. The major performance measures are evaluated based on this distribution. Under a cost structure, we propose to use the Quasi-Newton method and probabilistic global search Lausanne method to search for the global optimal system parameters. Numerical examples are presented to demonstrate the application of our approach. - 28 June 2013
- Published by Taylor & Francis in Optimization
- Vol. 64 (4) , 941-955
Randomized controlling arrival for a queueing system with subject to server breakdowns
This paper considers the optimal management problem of a finite-capacity M/M/1/K queueing system with -policy in which the server may break down while working. When the number of customers reaches its capacity K, no further arriving customers are allowed to enter the system. Customers are allowed to system with probability p or the customers are still unable to enter the system with probability 1 − p as the queue length decreases to a certain threshold value F. By applying the birth-and-death process, some important performance measures are derived. A cost model, developed to determine the optimal continuous and discrete control parameters for the -policy at a minimum cost, and sensitivity analysis are also studied.
- 28 June 2013
- Published by Taylor & Francis in Optimization
- Vol. 64 (4) , 941-955
Randomized controlling arrival for a queueing system with subject to server breakdowns
This paper considers the optimal management problem of a finite-capacity M/M/1/K queueing system with -policy in which the server may break down while working. When the number of customers reaches its capacity K, no further arriving customers are allowed to enter the system. Customers are allowed to system with probability p or the customers are still unable to enter the system with probability 1 − p as the queue length decreases to a certain threshold value F. By applying the birth-and-death process, some important performance measures are derived. A cost model, developed to determine the optimal continuous and discrete control parameters for the -policy at a minimum cost, and sensitivity analysis are also studied.
- 14 May 2013
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 90 (11) , 2279-2297
Availability of a repairable retrial system with warm standby components
In this paper, we study a repairable K-out-of-(M+W) retrial system with M identical primary components, W standby components and one repair facility. The time-to-failure and time-to-repair of the primary and standby components are assumed to be exponential and general distributions, respectively. The failed components are immediately for repair if the server is idle, otherwise the failed machines would enter an orbit. It is assumed that the retrial times are exponentially distributed. We present a recursive method using the supplementary variable technique and treating the supplementary variable as the remaining repair time to obtain the steady-state probabilities of down components at arbitrary epoch. Then, a unified and efficient algorithm is developed to compute the steady-state availability. The method is illustrated analytically for the exponential repair time distribution. Sensitivity analysis of the steady-state availability with respect to system parameters for a variety of repair time distributions is also investigated.
- 14 May 2013
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 90 (11) , 2279-2297
Availability of a repairable retrial system with warm standby components
In this paper, we study a repairable K-out-of-(M+W) retrial system with M identical primary components, W standby components and one repair facility. The time-to-failure and time-to-repair of the primary and standby components are assumed to be exponential and general distributions, respectively. The failed components are immediately for repair if the server is idle, otherwise the failed machines would enter an orbit. It is assumed that the retrial times are exponentially distributed. We present a recursive method using the supplementary variable technique and treating the supplementary variable as the remaining repair time to obtain the steady-state probabilities of down components at arbitrary epoch. Then, a unified and efficient algorithm is developed to compute the steady-state availability. The method is illustrated analytically for the exponential repair time distribution. Sensitivity analysis of the steady-state availability with respect to system parameters for a variety of repair time distributions is also investigated.