Abstracts - faqs.org

Abstracts

Business, general

Search abstracts:
Abstracts » Business, general

Admission policies in loss queueing models with heterogeneous arrivals

Article Abstract:

A loss queueing framework is characterized wherein the arrivals are categorized into different groups based on their arrival rate and expected service time. The framework aimed to determined the maximum coverage as a function to a given cost structure. The model was represented by customer types and a request for a service of a system with a finite number of servers. Problem optimality conditions were also expressed by a nonlinear fraction program with pseudoconcave objective function and a convex feasible region. Moreover, an algorithm was utilized in the study that ran in O(n(super 2)) time. Results indicated that an optimal policy for two-server cases can be characterized as a root of a polynomial function of degree 3.

Author: Carrizosa, E., Conde, E., Munoz-Marquez, M.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1998
Research and Development in the Social Sciences and Humanities, Information Systems & Theory, Management Science, Methods, Models, Analysis, Usage, Mathematical optimization, Optimization theory, Nonlinear programming

User Contributions:

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

CAPTCHA


Computing Optimal Control Limits For GI-M-s Queueing Systems with Controlled Arrivals

Article Abstract:

An algorithm is developed to compute optimal control limits for queueing control. Previous papers and existing literature are cited concerning the model. Equations and characteristics of the queueing system are presented with results, and an approach to computing the return of a control limit policy is explained. Other models are discussed. The efficiency of the algorithm, as shown by computer time needed, is a significant improvement over the previous algorithm. An example is given and explained.

Author: Nunen, J.A., Puterman, M.L.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1983
Optimization, Algorithm Analysis, Markov Process, Computability

User Contributions:

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

CAPTCHA


A Diffusion Approximation for an M-G-m Queue with Group Arrivals

Article Abstract:

The M-G-m queue is studied. Random-sized groups of customers are serviced. The steady-state behavior of the system is studied using diffusion approximation. The delay probability and the mean queue length can be derived using this approximation. Numerical results are presented in tables.

Author: Kimura, T., Ohsone, T.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1984
Diffusion (Physics), Probability, Theory, Approximation, Diffusion

User Contributions:

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

CAPTCHA


Subjects list: Management science, Algorithms, Queuing theory, Algorithm, Operations Research
Similar abstracts:
  • Abstracts: An empirical comparison of continuous time models of the short term interest rate. The compatibility of one-factor market models in caps and swaptions markets: evidence from their dynamic hedging performance
  • Abstracts: A note in pricing Asian derivatives with continuous geometric averaging. A Note On Finding The Optimal Allocation Between a Risky Stock and A Risky Bond
  • Abstracts: Soft and hard models of human resource management: a reappraisal. The impact of the board on strategy: an empirical examination
  • Abstracts: Market segmentation in scientific publications: research patterns in American vs European management journals
  • Abstracts: The power of emotional appeals in promoting organizational change programs. Improving the creativity of organizational work groups
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.