Data wydruku: 03.02.2017 08:54 Strona 1 z 3 Subject name
Transkrypt
Data wydruku: 03.02.2017 08:54 Strona 1 z 3 Subject name
Subject name Operational Research Subject code E:05090W0 Faculty Department of Algorithms and Systems Modelling Course name Informatics Learning area technical sciences Learning profile general academic profile Study year 1 Type of subject Obligatory Study semester 1 Study level postgraduate studies ECTS 5.0 Number of ECTS credits Learning activity of student ch Participation in didactic classes included in study plan 45 Participation in consultation hours sh 0 Self-study hours 80 Sum Name of lecturer 45 80 Total number of study hours 125 Number of ECTS credits 5.0 prof. dr hab. inż. Krzysztof Giaro (Main teacher) Teachers: prof. dr hab. inż. Krzysztof Giaro Subject objectives Student will be able to model and analyse simple queueing systems with a stochastic arrival proces. Student will be able to apply and implement linear programming model. Students will know basic techniques and methods for constructing timetables in basic models of deterministic task scheduling. Learning outcomes Mode of delivery Course outcome Subject outcome Method of veryfication K_U16 The student is able to model a practical problem as a linear programming and determine its optimal solution. [SU4] Assessment of ability to use methods and tools [SU1] Assessment of task fulfilment K_U02 Student can match a stochastic model of a queuing system to its operational description and analyze its basic characteristics. [SU4] Assessment of ability to use methods and tools [SU2] Assessment of ability to analyze information K_W05 The student knows the classifications of scheduling problems and algorithms for optimal scheduling. [SW3] Assessment of text elaboration [SW1] Assessment of factual knowledge at the university Prerequisites Fundamentals of: - linear algebra, - theory of computing - discrete mathematics - probability and statistics Recommended components Data wydruku: 08.03.2017 22:15 Strona 1 z 3 Subject contents Components, characteristics, and classification of queuing systems, the problem of stability. Construction of queuing processes: number of requests in system, unfinished work. System delays, Little's law, flow conservation equation for work-conserving systems. Statistical evaluation of service demand over a given observation period. Types of request arrival processes and service time distributions. Performance evaluation of computer and multiterminal systems based on mean offered load. Birth and death process and the M/M/1 system. Generalized birth and death processes and practical models of Markovian queuing systems: Erlang formula, impact of processors aggregation and buffer sharing, impatient requests. Definition of linear programming Applications of linear programming Simplex method Elements of integer programming 3-field notation in task scheduling Project managment Scheduling on parallel machinges Scheduling on dedicated machines Recommended and required reading Required reading 1. Brucker P., Scheduling Algorithms, Springer, 2007. 2. Hiller F. Liberman G, Introduction to operations research, McGraw-Hill, 2010. 3. Błażewicz J., Cellary W., Słowiński R., Węglarz J., Badania operacyjne dla informatyków, WNT, Warszawa, 1983. 4. Joti Lal Jain, W. Boehm, Sri Gopal Mohanty: A Course on Queuing Models, Chapman & Hall 2006 Recommeded reading 1. Judin D.E, Golsztejn E.G., Metody programowania liniowego, WNT 1964. 2. L. Kleinrock: Queuing systems, vol. I, J. Wiley 1975 Data wydruku: 08.03.2017 22:15 Strona 2 z 3 Lesson type and method of instruction Lesson type Number of study hours Lecture Tutorial Laboratory Project Seminar 30.0 15.0 0.0 0.0 0.0 Total number of study hours per semester included in study plan 45 e-learning hours included: 0.0 Assesment methods and criteria Subject passing criteria Passing threshold Percentage of the final grade Final test, task scheduling 50.0 33.0 Final test, linear programming 50.0 33.0 Final test, queueing systems 50.0 34.0 Example issues / example questions / tasks being completed Language of instructions Polish Work placement Not applicable Data wydruku: 08.03.2017 22:15 Strona 3 z 3