Minimizing Delays in the GI-G-1 Queue

Article Abstract:

The determination of what service time distribution should be used to minimize delays in a GI-G-1 queue is discussed. The issue is how the probability mass should be spread around the mean. The desired stochastic ordering of the steady-state waiting-time distributions does not always hold. The service-time distribution minimizing the average delay maximizes the proportion of customers delayed for hyperexponential interarrival-time distributions.

Modeling, Data modeling software, Models, Probability, Discrete Mathematics

---

Optimal Prediction of Queue Lengths and Delays in Gi-M-M Multiserver Queues

Article Abstract:

A queue length predictor and delay predictor is given for Gi-M-M queues. Multiserver predictors have application in telephony, multiprocessing computers, and industrial job shop systems containing service centers with parallel servers or channels. Numerical examples demonstrate basic properties of the mean square predictors. Tables and graphs present results.

Scientific Research

---

Similar abstracts:

• Abstracts: Optimal Prediction of Times and Queue Lengths in the GI-M-1 Queue

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.