Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Collection
For ¥0.57 per day, unlimited downloads CREATE MEMBERSHIP Download

toTop

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

home > search >

The M/D/1+D queue has the minimum loss probability among M/G/1+G queues

Author:
Inoue, Yoshiaki   Takine, Tetsuya  


Journal:
Operations Research Letters


Issue Date:
2015


Abstract(summary):

Abstract

We consider the loss probability View the MathML source in the stationary M/G/1 queue with generally distributed impatience times (M/G/1+G queue). Recently, it was shown that View the MathML source increases with service times in the convex order. In this paper, we show that View the MathML source also increases with impatience times in the excess wealth order. With these results, we show that View the MathML source in the M/D/1+D queue is smallest among all M/G/1+G queues with the same and finite arrival rate, mean service time, and mean impatience time.



Page:
629-632


VIEW PDF

The preview is over

If you wish to continue, please create your membership or download this.

Create Membership

Similar Literature

Submit Feedback

This function is a member function, members do not limit the number of downloads