Skip to main content
Log in

Finite Population Loss And Delay Queueing System With Nopassing

  • Short Note
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

A loss and delay queueing system with nopassing has been investigated in this paper. Due to restriction of nopassing the customers are allowed to depart from the system in the chronological Oder of their arrival. The customers are classfied into two classes depending upon whether they can wait or are lost when all servers are busy. The customers arriving in Poisson fashion from infinite\finite population at service facility having multi-servers, are served exponentially. The expressions for the expected waiting time are derived explicitly by using queue size distribution of the number of customers present in the system. The numerical results for the expected waiting time, and the difference between expected waiting times of customers having exponential service time and zero service time have been provided in tables for finite capacity and finite population models. The relevant graphs have also been drawn to visualise the effects of traffic intensity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. WASHBURN, A. (1974): A multh-server queue with nopassing, Oper. Res. 22, pp. 428–434.

    Article  Google Scholar 

  2. SHARMA, M.B., KUMAR, G.C. (1983): A limited multi-server queue without passing, Indian J. Pure Appl. Math. 14 (8), pp. 935–939.

    Google Scholar 

  3. JAIN, M., SHARMA, B. AND SHARMA, G.C. (1989): On nopassing multi-server queueing model with two types of customers and discouragement, J. Math. Phy. Sci. 23(4), pp. 319–329.

    Google Scholar 

  4. SHONICK, W. (1970): A stochastic model for occupancy-related random variables in general acute hospitals. J. Am. Stat. Asso. 65, pp. 1974–1500.

    Article  Google Scholar 

  5. AKINPELU, J. AND SHOOG, R. (1985): Controlling transients and overloads in common channel signaling networks. Teletraffici issue in advanced information Soc., pp. 996–1002.

    Google Scholar 

  6. SHORE, H. (1988): Sample approximation for GIGC queue II: The moments, the inverse distribution function and loss function of the number in the system and of the queue delay, J. Appl. Res. Soc. 39(4), pp. 381–391.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jain, M. Finite Population Loss And Delay Queueing System With Nopassing. OPSEARCH 35, 261–276 (1998). https://doi.org/10.1007/BF03399219

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03399219

Navigation