Skip to main content
  • Book
  • © 2013

Performance Analysis of Closed Queueing Networks

  • 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?
  • Includes supplementary material: sn.pub/extras

Part of the book series: Lecture Notes in Economics and Mathematical Systems (LNE, volume 663)

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (7 chapters)

  1. Front Matter

    Pages i-xxiii
  2. Introduction

    • Svenja Lagershausen
    Pages 1-3
  3. Closed Queueing Networks

    • Svenja Lagershausen
    Pages 5-13
  4. Literature Review

    • Svenja Lagershausen
    Pages 15-44
  5. Decomposition Approach

    • Svenja Lagershausen
    Pages 45-60
  6. Markov-Chain Approach

    • Svenja Lagershausen
    Pages 61-130
  7. Distribution of the Time Between Processing Starts

    • Svenja Lagershausen
    Pages 131-157
  8. Conclusion

    • Svenja Lagershausen
    Pages 159-160
  9. Back Matter

    Pages 161-169

About this book

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.

Authors and Affiliations

  • , Department for Supply Chain Management a, University of Cologne, Cologne, Germany

    Svenja Lagershausen

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access