Randomized controlling arrival for a queueing system with subject to server breakdowns

Abstract

This paper considers the optimal management problem of a finite-capacity M/M/1/K queueing system with h p; Fi-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 h p; Fi-policy at a minimum cost, and sensitivity analysis are also studied.

Admission control for finite capacity queueing model with general retrial times and state-dependent rates

“…The performance analysis of unreliable M/M/2/K queueing model by incorporating both F -policy and N -policy was developed by Jain et al [20]. In recent years, some researchers have contributed to the controlling of the admission of jobs in the system based on F -policy [14,6,39,7,15,18]. Yeh et al [41] developed a finite capacity single server Markovian queueing model under the < p − F > policy and established the steady-state analytical formulae for various performance indices.…”

Randomized control of arrivals in a finite-buffer GI/M/1 system with starting failures

“…Randomized control of N -policy [5,6,14,19,20,[23][24][25] Randomized control of T -policy [12,19,21,26] Randomized control of F -policy [3,4,6,24,29] examined by [13]. For the F -policy M/H 2 /1/K queue with server breakdowns and exponential startup times, [1] formulated an optimization problem to determine the optimal capacity, the optimal threshold, the optimal startup rate, and the optimal repair rate at the minimum expected cost per unit time.…”