Logo - springer
Slogan - springer

Business & Management - Production & Logistics | Performance Analysis of Closed Queueing Networks

Performance Analysis of Closed Queueing Networks

Lagershausen, Svenja

2013, XXIII, 169 p. 49 illus., 5 illus. in color.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-3-642-32214-3

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-642-32213-6

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

  • First exact analysis of closed production systems for finite-capacity networks with general processing times
  • High-quality vector graphics support the main text
  • Extensive examples to add value to the content​

This book deals with the performance analysis of closed queueing networks with general processing times and finite buffer spaces. It offers a detailed introduction to the problem and a comprehensive literature review. Two approaches to the performance of closed queueing networks are presented. One is an approximate decomposition approach, while the second is the first exact approach for finite-capacity networks with general processing times. In this Markov chain approach, queueing networks are analyzed by modeling the entire system as one Markov chain. As this approach is exact, it is well-suited both as a reference quantity for approximate procedures and as extension to other queueing networks. Moreover, for the first time, the exact distribution of the time between processing starts is provided.

Content Level » Research

Keywords » Blockage - CONWIP - Markov-Chains - Performance Analysis - Production systems

Related subjects » Computational Statistics - Operations Research & Decision Theory - Production & Logistics

Table of contents / Sample pages 

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Production / Logistics.