Topological arrangements of M/G/c/K, M/G/c/c queues in transportation and material handling systems

Authors:
Prince Bedell;J. MacGregor Smith
Affiliations:
Department of Mechanical Engineering, Indiana University-Purdue University, Indiannapolis, IN, United States;Department of Mechanical and Industrial Engineering, University of Massachusetts Amherst, MA 01003, United States
Venue:
Computers and Operations Research
Year:
2012

Citing 12
Cited 0

Asymptotic behavior of the expansion method for open finite queueing networks

Computers and Operations Research
Probability, statistics, and queueing theory with computer science applications

Probability, statistics, and queueing theory with computer science applications
An analytic model for design of a multivehicle automated guided vehicle system

Management Science
P-Complete Approximation Problems

Journal of the ACM (JACM)
Fundamentals of Computer Alori

Fundamentals of Computer Alori
M/G/c/K blocking probability models and system performance

Performance Evaluation
Simulation with Arena

Simulation with Arena
Modeling and Analysis of Congestion in the Design of Facility Layouts

Management Science
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems
An M/G/C/C state-dependent network simulation model

Computers and Operations Research
Isolation Method in a Network of Queues

IEEE Transactions on Software Engineering
Optimal design and performance modelling of M/G/1/K queueing systems

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

Finite buffer, single server queues with general service times along with state dependent queues were shown to be robust with respect to the general flow processes in transportation and material handling systems (MHS). This paper examines the integration of multi-server and state dependent queues and the robustness properties in these queueing network models. It is also shown that the topological arrangements problem (TAP) in a finite queueing network is NP-Hard. Extensive computational results are included to test the properties of these network models to changes in service times, buffers, and other MHS network parameters.