000 03704nam a22004695i 4500
001 978-1-4614-6765-6
003 DE-He213
005 20140220082826.0
007 cr nn 008mamaa
008 130521s2013 xxu| s |||| 0|eng d
020 _a9781461467656
_9978-1-4614-6765-6
024 7 _a10.1007/978-1-4614-6765-6
_2doi
050 4 _aHD30.23
072 7 _aKJT
_2bicssc
072 7 _aKJMD
_2bicssc
072 7 _aBUS049000
_2bisacsh
082 0 4 _a658.40301
_223
100 1 _aHaviv, Moshe.
_eauthor.
245 1 0 _aQueues
_h[electronic resource] :
_bA Course in Queueing Theory /
_cby Moshe Haviv.
264 1 _aNew York, NY :
_bSpringer New York :
_bImprint: Springer,
_c2013.
300 _aXIV, 221 p. 32 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aInternational Series in Operations Research & Management Science,
_x0884-8289 ;
_v191
505 0 _aThe 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.
520 _aQueueing 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.
650 0 _aEconomics.
650 0 _aOperations research.
650 1 4 _aEconomics/Management Science.
650 2 4 _aOperation Research/Decision Theory.
650 2 4 _aOperations Research, Management Science.
650 2 4 _aMathematical Modeling and Industrial Mathematics.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781461467649
830 0 _aInternational Series in Operations Research & Management Science,
_x0884-8289 ;
_v191
856 4 0 _uhttp://dx.doi.org/10.1007/978-1-4614-6765-6
912 _aZDB-2-SBE
999 _c95750
_d95750