Abstracts - faqs.org

Abstracts

Business, general

Search abstracts:
Abstracts » Business, general

On pooling in queueing networks

Article Abstract:

The value of complete pooling in a queueing service network was examined by comparing the steady-state mean sojourn times in the specialized and flexible server models. The pooling phenomenon takes one of three forms, namely, pooling tasks, pooling queues or pooling servers. An efficiency index was utilized to determine when pooling is advantageous. The models used in the study assume that service is unaltered and were described in terms of customers who seek service provided by servers. Empirical results showed that pooling is always useful in light traffic since customers at the pooled system enjoy a service rate that is the total capacity of the specialized server. On the other hand, pooling can either be advantageous or disadvantageous in heavy traffic. These findings indicate that good planning is required for pooling in queueing networks to optimize its benefits.

Author: Mandelbaum, Avishai, Reiman, Martin I.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1998
Management Theory & Techniques, Customer Relations, Operations Research, Management science, Management, Customer service, Queuing theory, Traffic flow

User Contributions:

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

CAPTCHA


New polynomial shortest path algorithms and their computational attributes

Article Abstract:

The Partitioning Shortest Path (PSP) algorithm is designed to locate the shortest path from a given node in a network to all other nodes. Research into the PSP algorithm identifies six variants of the algorithm related to negative arc lengths without negative cycles and nonnegative arc lengths. These variants help to maintain both sharp and near-sharp properties of the algorithm. One sharp and two near-sharp variants are tested extensively; 90 network configurations for three network topologies are tested for 4,500 hypothetical problems. The test results indicate that the new PSP algorithm variants perform better than all other known variants tested, and that one of the variants for maintaining near-sharp properties performs the best on the test problem population discussed.

Author: Glover, Fred, Klingman, Darwin D., Phillips, Nancy V., Schneider, Robert F.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1985
Research, Network analysis (Planning), Algorithms, Partitions (Mathematics)

User Contributions:

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

CAPTCHA



Subjects list: Models
Similar abstracts:
  • Abstracts: The new meaning of corporate social responsibility. Green schemes: corporate environmental strategies and their implementation
  • Abstracts: A portfolio approach to risk reduction in discretely rebalanced option hedges. The effects of the sample size, the investment horizon and market conditions on the validity of composite performance measures: a generalization
  • Abstracts: Optimal compensation for data-sharing in registration processes
  • Abstracts: The effects of task size and similarity on the decision behavior of bank loan officers. The decision-making paradigm of organizational design
  • Abstracts: A bivariate first-order autoregressive time series model in exponential variables (Bear 1). An autoregressive process for beta random variables
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.