Technical Note—A Single-Server Queue with Service Times Depending on the Order of Services

Hisashi Mine, Katsuhisa Ohno and Takatsugu Koizumi
Additional contact information
Hisashi Mine: Kyoto University, Kyoto, Japan
Katsuhisa Ohno: Kyoto University, Kyoto, Japan
Takatsugu Koizumi: Asahi Chemical Industries, Osaka, Japan

Operations Research, 1976, vol. 24, issue 1, 188-190

Abstract: This note deals with a GI / G /1 queuing system with service times depending on the order of services in each busy period. We derive a sufficient condition under which the length of the first busy period starting with an arbitrary initial state is almost surely finite.

Date: 1976
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.24.1.188 (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:24:y:1976:i:1:p:188-190

Access Statistics for this article

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