| Article ID: | iaor1991323 |
| Country: | Netherlands |
| Volume: | 44 |
| Issue: | 1 |
| Start Page Number: | 60 |
| End Page Number: | 66 |
| Publication Date: | Jan 1990 |
| Journal: | European Journal of Operational Research |
| Authors: | Alfa Attahiru Sule |
A technique is presented for approximating queue lengths in a single server queue with time-varying Poisson input and constant service times. The approximation is based on using the Maximum Entropy Principle to estimate the emptiness probabilities which play a significant role in studying queues of this class. The results of the approximation and exact method are compared.