[ 201WTMSQUTU22 ] UE Queueing theory

Workload Education level Study areas Responsible person Hours per week Coordinating university
1,5 ECTS B3 - Bachelor's programme 3. year Mathematics Dmitry Efrosinin 1 hpw Johannes Kepler University Linz
Detailed information
Original study plan Bachelor's programme Technical Mathematics 2023W
Objectives Support to achieve the goals of the corresponding course.
  1. Introduction to the queueing theory
  2. Some important random processes. Markov chains
  3. Birth-and-death queueing systems
  4. Queueing systems with an infinite population
  5. Queueing systems with a finite population
  6. Transient analysis of queueing systems
  7. Queueing systems with batch arrivals and service
  8. Erlang queueing systems
  9. Semi-Markov queueing systems
  10. Service disciplines in queueing systems
  11. Jackson queueing networks
  12. Gordon-Newell queueing networks
Criteria for evaluation Presentation of exercises
Language English and French
Changing subject? No
Earlier variants They also cover the requirements of the curriculum (from - to)
TM1WCUEBEDI: UE Queueing theory (2005S-2022S)
On-site course
Maximum number of participants 25
Assignment procedure Direct assignment