Abstract

The classical problem of single server Markovian queue with state dependent parameters is studied. Closed form computable transient state probabilities have been obtained for finite waiting space which can be easily extended to infinite waiting space model

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call