Queuing Theory
Code | Completion | Credits | Range | Language |
---|---|---|---|---|
11THRO | ZK | 2 | 2+0 | Czech |
- Lecturer:
- Pavla Pecherková (gar.), Ivan Nagy (gar.), Šárka Voráčová (gar.)
- Tutor:
- Pavla Pecherková (gar.), Ivan Nagy (gar.), Šárka Voráčová (gar.)
- Supervisor:
- Department of Applied Mathematics
- Synopsis:
-
Discrete event process, definition, random distribution, and probability. Basic processes, process of revitalisation. Markov process, Markov models, Kendall classification, model M/M/1, models M/M/n. Non-markovian models, model M/C/n, models G/G/n. Models with continuous flow. Service net, examples of Petri net. Computer simulation.
- Requirements:
-
linear algebra, graph theory, PT Petri net, fundamentals of mathematical statistics, MATLAB or C++ programming language
- Syllabus of lectures:
- Syllabus of tutorials:
- Study Objective:
-
Basic principles of stochastic processes, simulation techniques and elementary analytical methods for investigation of queueing systems.
- Study materials:
-
Bacceli F., Brémaud P.: Elements of Queuing Theory, Springer - Verlag, Applications of Mathematics 26, 1994
Kleinrock L.: Queuing Systems. orig. John Wiley ?Sons, ruský překlad Moskva, 1979
Kulvánek P., Brandalík F.: Operační analýza 1, Teorie hromadné obsluhy, Alfa
- Note:
- Time-table for winter semester 2011/2012:
- Time-table is not available yet
- Time-table for summer semester 2011/2012:
- Time-table is not available yet
- The course is a part of the following study plans:
-
- ME nav.komb. 11/12 (compulsory course)
- DS nav.prez. 11/12 (compulsory course)
- ID nav.prez. 11/12 (compulsory course)
- ME nav.prez. 11/12 (compulsory course)
- PL nav.prez. 11/12 (compulsory course)