Abstracts - faqs.org

Abstracts

Business, general

Search abstracts:
Abstracts » Business, general

The queue inference engine: deducing queue statistics from transactional data

Article Abstract:

A technique to determine the queuing behavior of Poisson arrival queuing systems from Poisson assumption and transactional data is presented. The method suggests that for each period of congestion in which lines may form, the important quantities gathered are: the time-dependent mean number in the queue; the probability distribution of the number in the queue as observed by a randomly arriving customer; and mean waiting time in the queue. Research indicates findings are exact for a homogenous Poisson arrival procedure, and they are approximately correct for a Poisson procedure which displays a slow time variance.

Author: Larson, Richard C.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1990

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Locating a mobile server queueing facility on a tree network

Article Abstract:

Earlier in 1985, the authors developed a finite step algorithm to obtain an optimal location in their examination of a queueing-oriented facility location problem on a general network. Utilizing the same model, this analysis focuses on a tree network, finding simplifying properties of the objective function over paths of the tree. Two separate algorithms are created to search for the stochastic queue median (SQM) on a tree. The end product is an efficient algorithm that limits the search to a single well-defined path.

Author: Berman, Oded, Chiu, Samuel S., Larson, Richard C.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1985
Models, Planning, Industrial equipment, Facility management, Facilities management

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


An N server cutoff priority queue where arriving customers request a random number of servers

Article Abstract:

An N-server, multi-priority, Poisson arrival, nonpreemptive queue is considered in a police service allocation environment. The number of servers demanded is distributed along a known priority dependent probability. Service times are independent of each other, and independent of priority, system state and server identity. Lower priority customers are automatically queued in order to save servers for high priority customers.

Author: Larson, Richard C., Schaak, Christian
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1989
Management, Police administration, Police departments, Police communication systems, Police communications systems

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Research, Scheduling (Management), Queuing theory, Poisson processes
Similar abstracts:
  • Abstracts: The emerging flexible organization: perspectives from Silicon Valley. Stratocracy in high-technology firms
  • Abstracts: Rules for residential interest changed. New rules for S corporations. New automobile substantiation rules
  • Abstracts: Cooperation, opportunism, and the invisible hand: implications for transaction cost theory. Differentiation versus low cost or differentiation and low cost: a contingency framework
  • Abstracts: A causal model of linkages among environmental dimensions, macro organizational characteristics, and performance
  • Abstracts: Managerial influence in the implementation of new technology. Risk-return performance of diversified firms
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.