An Approximation Method for Tandem Queues with Blocking

@article{Brandwajn1988AnAM,
  title={An Approximation Method for Tandem Queues with Blocking},
  author={Alexandre Brandwajn and Lily Jow},
  journal={Oper. Res.},
  year={1988},
  volume={36},
  pages={73-83}
}
View via Publisher
users.soe.ucsc.edu
70 Citations
Highly Influential Citations
5
Background Citations
24
Methods Citations
22
Results Citations
1

70 Citations

Citation Type

Citation Type

Efficient Throughput Analysis of Production Lines Based on Modular Queues
TLDR
A decomposition regulation based on queue modules for the decomposition of the various topologies, and an iterative approximation method for calculating and iterating the queue module state probabilities until the throughput of the production line is obtained are defined.
Analytical and Scalable Analysis of Transient Tandem Markovian Finite Capacity Queueing Networks
TLDR
The model is used to describe urban traffic dynamics and to address a dynamic traffic signal control problem and shows the added value of using joint distributional information, and more generally spatial-temporal between-link dependency information, to enhance urban traffic operations.
Tandem Queue Models with Applications to QoS Routing in Multihop Wireless Networks
  • L. Le, E. Hossain
  • Computer Science, Business
    IEEE Transactions on Mobile Computing
  • 2008
TLDR
A unified tandem queue framework which is applicable for many different physical layer designs and the extension of the queueing and QoS routing framework to wireless networks with class-based queueing for QoS differentiation is presented.
A storage strategy for paperless order picking systems by multi-picker
TLDR
A storage assignment policy of heuristic, which must simultaneously consider travel distance and workload of each aisle is developed, which is shown to minimize mean travel time of an order.
Approximation Analysis of Open Acyclic Exponential Queueing Networks with Blocking
TLDR
An iterative procedure for approximating the marginal occupancy probabilities for each queue of the system is offered, based upon the SIMP approximation previously used for tandem queues.
Performance analysis of a flexible flow shop with random and state-dependent batch transport
TLDR
A decomposition method of state space is proposed for computing system performance measures and can be used as a basis for system design, analysis, and resource planning.
A decomposition method for assembly/disassembly systems with blocking and general distributions
TLDR
The approach combines the distributions discretization and a decomposition technique to analyze large manufacturing systems in a reasonable computational time and with good accuracy and it is shown that the cycle time distributions can be approximated reliably for large systems.
Control of a tandem queue with a startup cost for the second server
TLDR
This work presents a rather intuitive, easy to understand, and at the same time very accurate technique to approximate the optimal decision policy and shows that the approximation works extremely well for a wide range of parameter combinations.
Control of a tandem queue with a startup cost for the second server
TLDR
This work presents a rather intuitive, easy to understand, and at the same time very accurate technique to approximate the optimal decision policy for tandem queues and shows that the approximation works extremely well for a wide range of parameter combinations.
Evaluating relief center designs for disaster relief distribution
TLDR
A model and solution methodology is developed that can estimate relief center (RC) performance, measured by waiting time for victims and throughput, for any RC design and analyze the impact of key design decisions on these performance measures.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 25 REFERENCES
GERSHWIN An Efficient Decomposition S. B
  • GERSHWIN An Efficient Decomposition S. B
  • 1987
Approximate analysis of open networks of queues with blocking: Tandem configurations
TLDR
An approximation procedure is developed for the analysis of tandem configurations consisting of single server finite queues linked in series and gives results in the form of the marginal probability distribution of the number of units in each queue of the tandem configuration.
Equivalence and Decomposition in Queueing Systems - A Unified Approach
  • A. Brandwajn
  • Mathematics, Computer Science
    Perform. Evaluation
  • 1985
A new 'building block' for performance evaluation of queueing networks with finite buffers
TLDR
This work proposes a new 'building block', a model of a server with a variable buffer-size that enables efficient analysis of certain queueing networks with blocking due to limited buffer spaces, since it uses only product-form submodels.
An Efficient Decomposition S. B. Method for Approximate Evaluation of Production Lines with Finite Storage Space
  • Opns. Res
  • 1983
Modeling and Analysis of Three-Stage Transfer Lines with Unreliable Machines and Finite Buffers
TLDR
This algorithm suggests a general approach for solving large scale structured Markov chain problems by choosing a sum-of-products form solution for a class of states, and deriving the remaining expressions by using the transition equations.
Some Equivalence Properties for Queueing Networks with and without Blocking
A Note On Transfer Lines With Unreliable Machines, Random Processing Times, and Finite Buffers
Abstract We comment on a recent paper by Gershwin and Herman, with particular attention to their interpretation of the blocking phenomenon in transfer lines with finite buffers.
Approximate analysis of exponential tandem queues with blocking
Some Equivalence S., AND G. IAZEOLLA. Properties for Queueing Networks with and without Blocking
  • Proceedings of Performance '83
  • 1982
...
1
2
3
...