An Optimal Rejection Time for an M / G /1 Queuing System

Hisashi Mine and Katsuhisa Ohno
Additional contact information
Hisashi Mine: Kyoto University, Kyoto, Japan
Katsuhisa Ohno: Kyoto University, Kyoto, Japan

Operations Research, 1971, vol. 19, issue 1, 194-207

Abstract: This paper discusses the following model: (i) Arriving customers are accepted in the system in a time interval [ t 0 , t ′] and are rejected with compensation after time t ′; (ii) the server runs at the cost rate r 0 in a time interval [ t 0 , T ], t 0 ≦ t ′ ≦ T , and runs at the increased cost rate r 1 ( r 1 > r 0 ) after the closing time T , until the system becomes empty after time t ′. The time t ′ is called the rejection time. The paper finds the optimal rejection time, that is, the rejection time that minimizes the expected total cost. It can be shown that in certain cases the optimal rejection time can be determined by a nonlinear equation. Numerical examples are given for an M / M /1 queuing system, and the more generalized model is briefly discussed.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.1.194 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:19:y:1971:i:1:p:194-207

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().