Access the full text.
Sign up today, get DeepDyve free for 14 days.
We consider the M/G/1 queue with second optional service and server breakdowns. A customer leaves the system either after the first required service with probability (1 – θ ) or immediately goes for a second optional service with probability θ after the completion of the first required service. For this queueing model, it is rather difficult to obtain the steady-sate probability explicitly. We apply the maximum entropy approach to approximate the system size distributions by using the first and second moments of the system size. Accuracy comparisons between the two approximate solutions are conducted. Numerical results indicate that using the first moment approach is more accurate than using the second moment approach.
International Journal of Services Operations and Informatics – Inderscience Publishers
Published: Jan 1, 2011
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.