Gurantor department | Institute of Transport | Credits | 10 |

Subject guarantor | doc. Ing. Michal Dorda, Ph.D. | Subject version guarantor | doc. Ing. Michal Dorda, Ph.D. |

Study level | postgraduate | Requirement | Choice-compulsory type B |

Year | Semester | winter + summer | |

Study language | Czech | ||

Year of introduction | 2019/2020 | Year of cancellation | |

Intended for the faculties | FS | Intended for study types | Doctoral |

Instruction secured by | |||
---|---|---|---|

Login | Name | Tuitor | Teacher giving lectures |

DOR028 | doc. Ing. Michal Dorda, Ph.D. |

Extent of instruction for forms of study | ||
---|---|---|

Form of study | Way of compl. | Extent |

Full-time | Examination | 25+0 |

Part-time | Examination | 25+0 |

The student is able to characterize the individual types of queueing systems and can define what input data he / she needs to obtain for modeling the solved queueing system. These data can be processed by appropriate statistical methods. He has an overview of the mathematical models of queueing systems and can use these models to solve practical problems. It controls the modeling methods of queueing systems and is able to create mathematical models of queueing systems. Can use colorful Petri nets for modeling and simulation of queueing systems.

Lectures

Individual consultations

Project work

The course is devoted to methods of modeling and simulation of queueing systems. The student is acquainted with the methods used for modeling of mass control systems in time (so called transition analysis) and in steady state. Within the subject are discussed the models of individual mass control systems differing in assumptions, from the elementary Markov models to models requiring a more demanding mathematical apparatus. For simulation of mass control systems, the Petri color network is used.

BOLCH, Gunter. Queueing networks and Markov chains: modeling and performance evaluation with computer science applications. 2nd ed. Hoboken: Wiley, c2006. ISBN 0-471-56525-3.
ORTUZAR, Juan de Dios; WILLUMSEN, Luis G. Modelling transport. 2002.

HENSHER, David A.; BUTTON, Kenneth J. (ed.). Handbook of transport modelling. Emerald Group Publishing Limited, 2007.
HILLIER, Frederick S. a LIEBERMAN, Gerald J. Introduction to operations research [CD-ROM]. 8th ed. Burr Ridge: McGraw-Hill Higher Education, c2005. ISBN 0-07-321114-1.
Introduction to logistics systems planning and control [online]. Hoboken: Wiley, 2005 [cit. 2018-01-10]. ISBN 0-470-01404-0.
ZEIGLER, Bernard P., PRAEHOFER, Herbert a KIM, Tag Gon. Theory of modeling and simulation: integrating discrete event and continuous complex dynamic systems. 2nd ed. San Diego: Academic Press, c2000. ISBN 0-12-778455-1.
SOKOLOWSKI, John A. a BANKS, Catherine M., ed. Principles of modeling and simulation: a multidisciplinary approach [online]. Hoboken: John Wiley & Sons, 2008 [cit. 2018-01-10]. ISBN 978-0-470-40356-3.

Oral examination.

Solution and defense of the project on the given topic.

Subject has no prerequisities.

Subject has no co-requisities.

1) Selected pieces of knowledge of probability theory - generating functions, random variables used in the queueing theory, convolution.
2) Baysian statistical principles.
3) Stochastic programming.
4) Theory of random processes with continuous and discrete time.
5) Advanced knowledge of the queueing theory - methods of input flow modeling, methods of modeling of the operating time, methods of calculation of performance measures.
6) Markov queueing systems and methods of their modeling in time (transition analysis).
7) Markov queueing systems and their modeling methods in steady state.
8) Modeling of queueing systems with Erlang input flow and / or Erlang service time.
9) Modeling of M/D/1, M/G/1 and G/M/1 queueing systems.
10) Multi-operator systems with service lines that do not work continuously (due to malfunctions, maintenance, etc.).
11) Queueing networks and their modeling.
12) Possibilities of computer modeling of queueing systems (Witness, colored Petri nets).

Task name | Type of task | Max. number of points
(act. for subtasks) | Min. number of points |
---|---|---|---|

Examination | Examination |

Show history

Academic year | Programme | Field of study | Spec. | Zaměření | Form | Study language | Tut. centre | Year | W | S | Type of duty | |
---|---|---|---|---|---|---|---|---|---|---|---|---|

2021/2022 | (P1041D040006) Transport Systems | P | Czech | Ostrava | Choice-compulsory type B | study plan | ||||||

2021/2022 | (P1041D040006) Transport Systems | K | Czech | Ostrava | Choice-compulsory type B | study plan | ||||||

2020/2021 | (P1041D040006) Transport Systems | P | Czech | Ostrava | Choice-compulsory type B | study plan | ||||||

2020/2021 | (P1041D040006) Transport Systems | K | Czech | Ostrava | Choice-compulsory type B | study plan |

Block name | Academic year | Form of study | Study language | Year | W | S | Type of block | Block owner |
---|