Course: Queueing Theory

« Back
Course title Queueing Theory
Course code KMF/INTEF
Organizational form of instruction Lecture + Lesson
Level of course Master
Year of study 2
Semester Winter
Number of ECTS credits 6
Language of instruction Czech
Status of course Compulsory
Form of instruction Face-to-face
Work placements This is not an internship
Recommended optional programme components None
Lecturer(s)
  • Karamazov Simeon, prof. Ing. Dr.
  • Pozdílková Alena, Mgr. Ph.D.
Course content
1. Introduction to queuing theory - history, basic elements of queuing systems 2. Simulation models (mathematical vs. physics), Monte Carlo Method 3. Markov chains 4. Kendall's Notationification 5. The system M / M / 1 6. System M / M / n with limitless queue and orderly queue´s regimen 7. System M / M / n with finite length queues and regular queue´s regimen 8. The system M / M / n with the losses 9. The closed system 10. System M / D / 1 with limitless queue 11. System M / G / 1 with limitless queue 12. System M / EK / 1 with limitless queue

Learning activities and teaching methods
Monologic (reading, lecture, briefing), Dialogic (discussion, interview, brainstorming), Work with text (with textbook, with book), Methods of individual activities
Learning outcomes
The main goal of discipline is to familiarize students with systems that are experiencing operating processes between customers and serving the centers. Students acquaint themselves with the modeling for the purpose of find the best way of organizing queues so as to achieve, particularly maximize profits from their activities, prevent loss from downtime front or from the loss of impatient customers waiting customers the shortest possible time.
Students active use mathematical equipment, are able of logical thinking and are able active to use mathematicel skills in subjects informatics and electrical technology.
Prerequisites
Prerequisites for the discipline are: Probability Theory, Mathematical Statistics and Theory of random functions.

Assessment methods and criteria
Oral examination, Written examination, Home assignment evaluation

Credit requirements is success in written test - at least 50% of success is required and presentation of case studies.
Recommended literature
  • Linda, Bohdan. Stochastické metody operačního výzkumu. Bratislava: Statis, 2004. ISBN 80-85659-33-6.
  • Saaty, T. Elements of Queueing Theory with Applications. McGraw-Hill, 1961.
  • Sztrik, J. Basic Queueing Theory. Debrecen University Egyetem.
  • Sztrik, J. Practical queueing theory. Teaching material. Debrecen University Egyetem, 2005.
  • Wolf, R. Stochastic Modeling and the Theory of Queues. Prentice-Hall, 1989.


Study plans that include the course
Faculty Study plan (Version) Category of Branch/Specialization Recommended year of study Recommended semester
Faculty: Faculty of Electrical Engineering and Informatics Study plan (Version): Information Technology (2015) Category: Informatics courses 2 Recommended year of study:2, Recommended semester: Winter
Faculty: Faculty of Electrical Engineering and Informatics Study plan (Version): Information Technology (2016) Category: Informatics courses 2 Recommended year of study:2, Recommended semester: Winter
Faculty: Faculty of Electrical Engineering and Informatics Study plan (Version): Information Technology (2014) Category: Informatics courses 2 Recommended year of study:2, Recommended semester: Winter