Nondeterministic polling systems
Article Abstract:
A nondeterministic polling system in which one server attended to several stations was studied. The service discipline at each station was either non-exhaustive, in which the server responded to only one request if the station was not empty at the instant of polling; exhaustive, in which the server responded to requests until the station was empty; gated, in which the server responded only to the requests that were present at the instant of polling; or semi-exhaustive, in which the server responded to requests until the amount of requests awaiting a response was one less than the amount encountered by the server when the station was polled. Cycle times, stability conditions, Conservation Laws, and individual mean waiting times were obtained.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1991
User Contributions:
Comment about this article or add new information about this topic:
Control policies for the M.sup.X/G/1 queueing system
Article Abstract:
An M.sup.X/G/1 queueing system is examined under two different controlling conditions in order to determine the stationary optimal policy under a linear cost structure and the mean waiting time of a customer for a given m value. The first system features an ordinary M.sup.X/G/1 system without vacations where the server waits for the queue to reach a certain length before starting its processing. In the second system the server takes a series of vacations at the end of a busy period and periodically checks the queue length to see if it should begin reprocessing. The vacations are used to do some other type of work.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1989
User Contributions:
Comment about this article or add new information about this topic:
Approximations for product departures from a single-server station with batch processing in multi-product queues
Article Abstract:
An estimate for the mean number of jobs and two characterizations of product departure streams is developed for a single-server station processing jobs belonging to multiple product classes. Methods for computing the probability distribution of product departure lot sizes and computing the squared coefficient of variation of the departure intervals are also developed. . Computational results indicate that the approximations are accurate for most applications.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1989
User Contributions:
Comment about this article or add new information about this topic: