rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Queues
    sub title: A Course in Queueing Theory
  name:
    name part: Haviv, Moshe.
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: xxu
    date issued: 2013
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XIV, 221 p. online resource.
  abstract: Queueing theory (the mathematical theory of waiting lines in all its configurations) continues to be a standard major area of operations research on the stochastic side. Therefore, universities with an active program in operations research sometimes will have an entire course devoted mainly or entirely to queueing theory, and the course is also taught in computer science, electrical engineering, mathematics, and industrial engineering programs. The basic course in queueing theory is often taught at first year graduate level, though can be taught at senior level undergraduate as well. This text evolved from the author’s preferred syllabus for teaching the course, presenting the material in a more logical order than other texts and so being more effective in teaching the basics of queueing theory. The first three chapters focus on the needed preliminaries, including exposition distributions, Poisson processes and generating functions, renewal theory, and Markov chains, Then, rather than switching to first-come first-served memoryless queues here as most texts do, Haviv discusses the M/G/1 model instead of the M/M/1, and then covers priority queues. Later chapters cover the G/M/1 model, thirteen examples of continuous-time Markov processes, open networks of memoryless queues and closed networks, queueing regimes with insensitive parameters, and then concludes with two-dimensional queueing models which are quasi birth and death processes. Each chapter ends with exercises.
  table of contents: The Exponential Distribution and the Poisson Process -- Introduction to Renewal Theory -- Introduction to Markov Chains -- From Single Server Queues to M/G/1 -- Priorities and Scheduling in M/G/1 -- M/G/1 Using Markov Chains and LSTs -- The G/M/1 Queueing System -- Continuous-time Markov Chains and Memoryless Queues -- Open Networks of Exponential Queues -- Closed Networks of Exponential Queues -- Insensitivity and Product-form Queueing Models -- Two-dimensional Markov Processes and their Applications to Memoryless Queues.
  note: by Moshe Haviv.
  subject:
    topic: Business
  subject:
    topic: Operations research
  subject:
    topic: Decision making
  subject:
    topic: Mathematical models
  subject:
    topic: Management science
  subject:
    topic: Business and Management
  subject:
    topic: Operation Research/Decision Theory
  subject:
    topic: Operations Research, Management Science
  subject:
    topic: Mathematical Modeling and Industrial Mathematics
  classification: HD30.23
  classification: 658.40301
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: International Series in Operations Research & Management Science, 191
  identifier: 9781461467656
  identifier: http://dx.doi.org/10.1007/978-1-4614-6765-6
  record info:
    record creation date: 130521
    record change date: 20151204171043.0
    record identifier: 978-1-4614-6765-6