Hostname: page-component-5c6d5d7d68-tdptf Total loading time: 0 Render date: 2024-08-08T05:25:44.988Z Has data issue: false hasContentIssue false
  • English
  • Français

Appointment scheme as compared to random service and arrival times from specific distributions

Published online by Cambridge University Press:  01 July 2016

Nasser Hadidi
Nasser Hadidi*
Affiliation:
Pahlavi University, Shiraz, Iran
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Fifth Conference on Stochastic Processes and their Applications
Information
Advances in Applied Probability , Volume 8 , Issue 2 , June 1976 , pp. 250 - 252
Copyright
Copyright © Applied Probability Trust 1976 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Conolly, B. W. (1974) The generalized state dependent Erlangian queue: The busy period. J. Appl. Prob. 11, 618–623.CrossRefGoogle Scholar
Hadidi, N. (1969) On the service time distribution and the waiting time process of a potentially infinite capacity queueing system. J. Appl. Prob. 6, 594–603.CrossRefGoogle Scholar
Hadidi, N. (1974) Busy period of queues with state dependent arrival and service rates. J. Appl. Prob. 11, 842–848.CrossRefGoogle Scholar
Hadidi, N. (1975) A queueing model with variable arrival rates. Periodica Mathematica Hungarica 6, 39–47.CrossRefGoogle Scholar
Natvig, B. (1974) On the transient state probabilities for a queueing model where potential customers are discouraged by queue length J. Appl. Prob. 11, 345–354.CrossRefGoogle Scholar
Natvig, B. (1975) On a queueing model where potential customers are discouraged by queue length. Scand. J. Statist. 2, 34–42.Google Scholar