COURSE UNIT TITLE

: QUEUING THEORY

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
STA 5104 QUEUING THEORY ELECTIVE 3 0 0 8

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Second Cycle Programmes (Master's Degree)

Course Coordinator

PROFESSOR DOCTOR UMAY ZEYNEP UZUNOĞLU KOÇER

Offered to

Statistics (English)
STATISTICS (ENGLISH)
Statistics (English)

Course Objective

This course aims to provide students with some methods in order to formally analyze the performance and design of various queueing systems. After a brief introduction to probability theory and Markov processes, it is expected the students will gain sufficiency in analyzing the design, operation and performance of both Markovian and non-Markovian queuing systems.

Learning Outcomes of the Course Unit

1   Defining basic concepts of queueing systems
2   Calculating performance measures of Markovian and non-Markovian queuing systems
3   Modeling practical systems as queuing problem
4   Making suggestions for queuing systems to operate more efficiently
5   Evaluating cost parameters of queuing systems and making suggestions for cost optimization
6   Making a research on recent literature about modeling queuing systems, preparing a report and a presentation on analyzing a queuing problem (real case study or theoretical problem)

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Introduction to queueing theory and basic definitions
2 The relation between the queuing systems and stochastic processes; Markov processes
3 Markov processes
4 Poisson processes and exponential distribution, preparing individual assignments
5 The analysis of Markovian queuing systems; M/M/1 model and its variants
6 The analysis of Markovian queuing systems; busy period analysis, waiting time analysis
7 MIDTERM
8 Erlang distribution; non-birth-death type queuing systems
9 Erlang distribution; non-birth-death type queuing systems
10 Embedded Markov chain technique- M/G/1 queuing system, preparing individual assignments
11 M/G/1 queuing system
12 G/M/1 queuing system, preparing presentations
13 G/M/1 queuing system, preparing presentations
14 Analysis and presentation of sample queuing problems

Recomended or Required Reading

Textbook(s):
D. Gross, C.M. Harris, 1998, Fundamentals of Queueing Theory , John Wiley and Sons, USA.
Supplementary Book(s):
S. M. Ross, 1996, Stochastic Processes , Wiley Series in Probability and Statistics, New Jersey.
L. Kleinrock, 1975, Queueing Systems Volume I: Theory , John Wiley and Sons, USA.

References:
Materials: None

Planned Learning Activities and Teaching Methods

Lecture, problem solving, homework, presentation

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 PRJ PROJECT
2 FCG FINAL COURSE GRADE PRJ * 1


*** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

None

Assessment Criteria

Evaluation of exams, homework and presentations.

Language of Instruction

English

Course Policies and Rules

Student responsibilities:
Attendance to at least 70% for the lectures is an essential requirement of this course and is the responsibility of the student. It is necessary that attendance to the lecture and homework delivery must be on time. Any unethical behavior that occurs either in presentations or in exams will be dealt with as outlined in school policy.

Contact Details for the Lecturer(s)

DEU Fen Fakültesi Istatistik Bölümü
e-mail: umay.uzunoglu@deu.edu.tr
Tel: 0232 301 85 60

Office Hours

It will be announced when the course schedule of the faculty is determined

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 14 3 42
Preparations before/after weekly lectures 14 4 56
Preparing presentations 2 20 40
Preparation for midterm exam 1 15 15
Preparing assignments 2 20 40
Preparation for final exam 1 15 15
Final 1 2 2
Midterm 1 2 2
TOTAL WORKLOAD (hours) 212

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10
LO.1555
LO.2555
LO.3555
LO.4555
LO.5555
LO.6555