Open AccessTechnical Note—A Single-Server Queue with Service Times Depending on the Order of Services
Author(s) -
Hisashi Mine,
Katsuhisa Ohno,
Takatsugu Koizumi
Publication year - 1976
Publication title -
operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.797
H-Index - 140
eISSN - 1526-5463
pISSN - 0030-364X
DOI - 10.1287/opre.24.1.188
Subject(s) - service (business) , computer science , queue , order (exchange) , state (computer science) , queueing theory , queue management system , operations research , computer network , mathematical optimization , mathematics , business , algorithm , marketing , finance
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom