|
|
|
Academic
courses
|
Course
title
|
Mathematical
models
of queueing theory
|
|
Volume
(number of credit
points)
|
4
|
|
Volume
(number of contact hours)
|
64
|
|
Number
of lectures
|
50
|
|
Number
of seminars, practical and laboratory works
|
14
|
|
Course level: 1-4
– bachelor;
5-6 – master; 7 – doctoral;
T –
further education
|
4
|
|
Prerequisites
|
Probability
theory
Mathematical analysis IV
Algebra I
|
|
Science
field, science sub-field
|
Mathematics
|
|
Equivalent
course
|
-
|
COURSE
DESIGNER(S)
|
Name
|
Surname
|
|
Svetlana
|
Asmuss
|
|
Nataļja
|
Budkina
|
COURSE
ABSTRACT
The aim of this course is to explain the students main concepts of queuing theory as well as basic queueing models.
The
course considers notions, results and methods of queueing theory,
mathematical simulation and analysis of queueing systems by applying
results and methods of queuieng
theory to the problems of planning and management.
RESULTS
The
students who successfully graduate the course will master the basic
concepts and results of queuing theory, which are necessary for
construction and analysis of the real queueing models.
REQUIREMENTS
FOR AWARDING CREDIT POINTS
During
the course each student must work out 2 homeworks and pass a control work.
The homeworks are discussed during the practical works. The practical
works, the homeworks and the control work give 30% of the final mark.
A
final exam gives 70% of the final mark.
COURSE
PLAN
|
No.
|
Topic
|
Planned amount in hours
|
|
1.
|
Queueing systems
and their modelling. Elements of queueing systems.
(lectures
– 8 hours)
|
8
|
|
2.
|
Erlang’s system.
(lectures
– 4 hours)
|
4
|
|
3.
|
Queueing systems
with waiting.
(lectures
– 4 hours, practical
works - 2 hours)
|
6
|
|
4.
|
Queueing
systems with queue size limited to m
customers.
(lectures
– 6 hours, practical
works - 2 hours)
|
8
|
|
5.
|
Queueing systems
with finite waiting time.
(lectures
– 8 hours, practical
works - 4 hours)
|
12
|
|
6.
|
Closed queueing
systems.
(lectures
– 4 hours, practical
works - 2 hours)
|
6
|
|
7.
|
Self-service
queueing systems.
(lectures
– 4 hours)
|
4
|
|
8.
|
Control work.
|
2
|
|
9.
|
Queueing systems
with more general distributions of service time.
(lectures
– 4 hours, practical
works - 2 hours)
|
6
|
|
10.
|
Queueing systems
with more general distributions of arrival and service time.
(lectures
– 2 hours)
|
2
|
|
11.
|
Queueing systems
with priority customers.
(lectures
– 6 hours)
|
6
|
LITERATURE
Basic
textbooks
|
1.
|
I. Akuļičs, M. Purgailis. Masu apkalpošanas teorijas elementi.
Zvaigzne, Rīga, 1980.
|
|
2.
|
Б. В. Гнеденко, И. Н. Коваленко.
Введение в теорию массового
обслуживания. Наука, Москва, 1987.
|
|
3.
|
T. Saaty. Elements of Queueing Theory. McGraw-Hill, New York, 1962.
|
|
4.
|
Х. Таха. Введение
в исследование операций. 2 том, Мир,
Москва,
1985.
|
|
5.
|
Е. С. Вентцель.
Исследование
операций: задачи, принципы,
методология.
Дрофа, Москва,
2004.
|
Further
reading
|
1.
|
R B. Cooper. Introduction to Queueing Theory (2nd edition). Elsevier
North Holland. Inc., New York, 1981.
|
|
2.
|
Математика
для экономистов: В 6 т./ Под ред. А.Ф.
Тарасюка. – ИНФРА, Москва, 2000. – (серия «Высшее
образование»). Т.6: Чернов В.П.,
Ивановский В.Б. Теория массового
обслуживания.
|
|
3.
|
Г.Ф.
Фомин.
Системы и модели массового
обслуживания в коммерческой
деятельности. Учеб. пособие. Финансы
и статистика, Москва, 2000.
|
Periodicals,
internet resources and other sources
|
1.
|
Any
articles from scientific journals corresponding to the course
contents.
|
|