In this course, we will learn about the basics of queueing theory, a mathematical approach to studying waiting lines or queues. We will also recap the relevant results regarding probability distributions and random processes.

Queueing theory is a method relevant to the design of shops, offices, hospitals, telecommunication networks, traffic engineering and more.

At the end of the course, students should be familiar with the basics of queueing theory.

Attendance is compulsory; students can miss 20% of the course units.

The course will be taught in the form of lectures and homework assignments, which will be discussed in the subsequent lectures. Students will be asked to solve some exercises in the programming/statistical language R (or another language of their choice). See The Comprehensive R Archive Network and R Studio.

The assessment will consist of

• homework (30% weight)
• midterm exam (30% weight)
• final exam (40% weight)

Students need at least 50% to successfully pass the course.

STEOP Mathematics and Statistik courses are necessary prerequisites. Prior familiarity with probability theory is recommended.

Please log in with your WU account to use all functionalities of read!t. For off-campus access to our licensed electronic resources, remember to activate your VPN connection connection. In case you encounter any technical problems or have questions regarding read!t, please feel free to contact the library at readinglists@wu.ac.at.

LVP Mathematik, VUE Statistik.