1) Prerequisites
Basic knowledge of probability at the level:
S.M. Ross, Introduction to probability models, 9th edition, Academic Press, 2007 (chapters 1-3).
2) Aim of the course
To provide insight in the theory of queueing models. The following subjects will be treated:
Fundamental queueing relations (Little's law, PASTA property) Markovian queues (M/M/1 queue, M/M/c queue, M/E_r/1 queue)
M/G/1 queue and G/M/1 queue
Mean value technique
Priority queues
Variations of the M/G/1 queue
Insensitive queues (M/G/c/c queue and M/G/infinity queue)
3) Rules about Homework/Exam
There will be four homework sets and a final written exam. The average homework grade counts for 20%, the final exam grade counts for 80%. For the final exam grade, there is a minimum requirement of 5.0 to pass the course.
When taking the resit exam, either the same rule as above will apply
(retaining the homework grade for 20%), or the exam grade counts for
100%, whichever comes out highest.
4) Lecture notes/Literature
The course material consists of the lecture notes on Queueing Theory, written by Ivo Adan and Jacques Resing of the TUE. It contains all material for the course, as well as many relevant exercises, and most answers/solutions.
The lecture notes are freely available as a pdf file at http://www.win.tue.nl/~iadan/
5) Lecturers
Dr. J.L. Dorsman, Korteweg-de Vries Institute for Mathematics, University of Amsterdam, j.l.dorsman@uva.nl
Prof. dr. R. Nunez Queija, Korteweg-de Vries Institute for Mathematics, University of Amsterdam, r.nunezqueija@uva.nl
Dr. W.R.W. Scheinhardt, Department of Applied Mathematics, University of Twente, w.r.w.scheinhardt@utwente.nl
- Docent: Jan-Pieter Dorsman
- Docent: Sindo Nunez Queija
- Docent: Werner Scheinhardt