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.
Hisashi Mine, Katsuhisa Ohno, Takatsugu Koizumi, (1976) Technical Note—A Single-Server Queue with Service Times Depending on the Order of Services. Operations Research 24(1):188-190.
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.