Skip to main content
Book Chapter

A Review of Decomposition Methods for Open Queueing Networks

  • Rabta B
Springer London, (2009), 25-42
DOI: 10.1007/978-1-84882-748-6_3
N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

… and Bitran and Morabito (1996) analyzed both performance evaluation models and optimization models for … by assuming that customer routing transitions are characterized by a Markov chain decomposable into … The type of a customer is allowed to influence his choice of path …

Cite

CITATION STYLE

APA

Rabta, B. (2009). A Review of Decomposition Methods for Open Queueing Networks. In Rapid Modelling for Increasing Competitiveness (pp. 25–42). Springer London. https://doi.org/10.1007/978-1-84882-748-6_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free