LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Computational analysis and optimization of randomized control of N-policy for an M/G/1/K queue with starting failures

Photo from wikipedia

Abstract This article aims to present the steady-state analysis in finite-buffer M/G/1 queues with starting failures under a randomized control of N-policy. When the system empties, the server is turned… Click to show full abstract

Abstract This article aims to present the steady-state analysis in finite-buffer M/G/1 queues with starting failures under a randomized control of N-policy. When the system empties, the server is turned off. If the system size reaches the threshold N, the server is turned on with probability or turned off with probability The server needs a startup time before providing service. If the server is started successfully (with probability ), customers are served immediately. When the server is started unsuccessfully, he is started again. It is assumed that the restart is always successful. Using the supplementary variable method, we obtain the stationary distribution of the number of customers in the system. We develop a number of performance measures. A cost model is constructed, and we then determine numerical values of the optimal service rate to minimize the average cost per unit time. Finally, numerical examples are provided to show the effects of system parameters on performance measures and the optimal service rate.

Keywords: control policy; randomized control; analysis; starting failures

Journal Title: Communications in Statistics - Theory and Methods
Year Published: 2020

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.