A simulation framework for networked queue models: Analysis of queue bounds in a G/G/c supply chain

DOI10.1155/JAMDS/2006/87514MaRDI QIDQ955484zbMATH OpenOpenAlexFDO

Authors Mahyar A. Amouzegar, Khosrow Moshirvaziri

Publication date 20 November 2008

Published in Journal of Applied Mathematics and Decision Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/129491

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Review text

Summary: Some limited analytical derivation for networked queue models has been proposed in the literature, but their solutions are often of a great mathematical challenge. To overcome such limitations, simulation tools that can deal with general networked queue topology must be developed. Despite certain limitations, simulation algorithms provide a mechanism to obtain insight and good numerical approximation to parameters of networked queues. This paper presents a closed stochastic simulation network model and several approximation and bounding schemes for G/G/c systems. The analysis was originally conducted to verify the integrity of simulation models used to develop alternative policy options conducted on behalf of the US Air Force. We showed that the theoretical bounds could be used to approximate mean capacities at various queues. In this paper, we present results for a G/G/8 system though similar results have been obtained for other networks of queues as well.

Recommendations

• A Model for the Dynamics of large Queuing Networks and Supply Chains
• Modeling a supply chain using a network of queues
• Generalized queueing network analysis of integrated supply chains
• Queueing network model for a class of material-handling systems
• A quick simulation method for excessive backlogs in networks of queues
• Modeling and optimization of M/G/1-type queueing networks: an efficient sensitivity analysis approach
• Models and analysis of queueing networks
• scientific article; zbMATH DE number 1129912

Cites work

• Heavy traffic theory for queues with several servers. I
• scientific article; zbMATH DE number 1416627 (Why is no real title available?)
• scientific article; zbMATH DE number 3206641 (Why is no real title available?)
• Some Inequalities for Parallel-Server Queues
• Some Inequalities in Queuing
• Technical Note—Some Simpler Bounds on the Mean Queuing Time

Cited in

(1)

• A two-stage queueing network on form postponement supply chain with correlated demands

This page was built for publication: A simulation framework for networked queue models: Analysis of queue bounds in a G/G/c supply chain

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q955484)