Performance Analysis of Closed Queueing Networks

  • Svenja¬†Lagershausen

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

Table of contents

  1. Front Matter
    Pages i-xxiii
  2. Svenja Lagershausen
    Pages 1-3
  3. Svenja Lagershausen
    Pages 5-13
  4. Svenja Lagershausen
    Pages 15-44
  5. Svenja Lagershausen
    Pages 45-60
  6. Svenja Lagershausen
    Pages 61-130
  7. Svenja Lagershausen
    Pages 131-157
  8. Svenja Lagershausen
    Pages 159-160
  9. Back Matter
    Pages 161-169

About this book

Introduction

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.

Keywords

Blockage CONWIP Markov-Chains Performance Analysis Production systems

Authors and affiliations

  • Svenja¬†Lagershausen
    • 1
  1. 1., Department for Supply Chain Management aUniversity of CologneCologneGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-32214-3
  • Copyright Information Springer-Verlag Berlin Heidelberg 2013
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Business and Economics
  • Print ISBN 978-3-642-32213-6
  • Online ISBN 978-3-642-32214-3
  • Series Print ISSN 0075-8442
  • About this book