A Study on the Queue Length of the State-Dependent of an Unreliable Machine

Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2014, Vol 7, Issue 1

Abstract

In this paper, we consider a state-dependent queueing system in which the machine is subject to random breakdowns. Jobs arrive at the system randomly following a Poisson process with state-dependent rates. Service times and repair times are exponentially distributed. The machine may fail to operate with probability depending on the number of jobs completed since the last repair. The main result of this paper is the matrix-geometric solution of the steady-state queue length from which many performance measurements such as mean queue length, machine utilization are obtained.

Authors and Affiliations

M. ReniSagaya Raj , B. Chandrasekar , S. Anand Gnanaselvam

Keywords

Related Articles

Pathos Vertex Semientire Block Graph

The pathos vertex semientire block graph denoted by Pvb(G) is the graph whose vertex set is V(T) bi r and the two vertices are adjacent if and only if they are adjacent vertices, vertices lie on the blocks, vertices lie...

 Suitable mode of Public Transport – A Decision making model using Possibility Intuitionistic Fuzzy Soft Sets

 In this paper, the concept of Possibility Intuitionistic Fuzzy Soft Sets is used to develop a decision making model for choosing a suitable mode of transport.

On the Zeros of Lacunary Polynomials

In this paper we find the bounds for the zeros of some special lacunary polynomials. Our results generalize some known results in the distribution of zeros of polynomials.

 Evaluation of Watermarking Techniques

 Now a days the copyright of multimedia and secrete information is very difficult to transfer across the internet multimedia objects must be compressed before transmitting the data. The JPEG compression is one of th...

On Soft πgb-Continuous Functions in Soft Topological Spaces

The aim of this paper is to define and study the concepts of soft πgb-continuous function, soft πgb-irresolute function on soft topological spaces. Also we have introduced the concept soft πgb-closure and soft πgb-interi...

Download PDF file
  • EP ID EP131625
  • DOI -
  • Views 121
  • Downloads 0

How To Cite

M. ReniSagaya Raj, B. Chandrasekar, S. Anand Gnanaselvam (2014). A Study on the Queue Length of the State-Dependent of an Unreliable Machine. INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY, 7(1), 42-49. https://europub.co.uk/articles/-A-131625