Home > Search Results: Otarbayeva, Zhamilya
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Planning a holidays in Europe with using goal programming
 Otarbayeva, Zhamilya ; Skočdopolová, Veronika (advisor) ; Kuncová, Martina (referee)
In this thesis I consider possibility to spend my vacation in one of the three countries: Spain, France, Italy. In each country I chose ten cities, which I would like to visit. I will use Travel Salesman Problem to decide the best route inside each country according to three criteria: Cost, Minutes and Transport. There is also a possibility to choose the type of transport: train or combination of train and airplane. Also I will use Weighted goal programming and Chebyshev goal programming to optimize all criteria simultaneously. In the end I will use multiple -- criteria decision analysis to compare results. According to three methods (ORESTE, ELECTRE III, TOPSIS) I will choose one of the states for my vacation. I will make all calculation in program MPL and in Excel using solver SANNA.
Detailed record
Special models of the theory of queue
 Otarbayeva, Zhamilya ; Kořenář, Václav (advisor) ; Šindelářová, Irena (referee)
Abstract Title: Special models of the theory of queue Author: Zhamilya Otarbayeva Department: Department of Econometrics Supervisor: Ing. Václav Kořenář, CSc. The main aim of this work is describe more complicated queuing models. Firstly I described the models with priority. There are mentioned three types of them: relative, absolute and dynamic. For describing I used formulas and examples from people's life for showing situations where we can meet such kind of queuing models. The second theoretical part contains description of non-Poisson models. I explain four of them: model with Erlang's input and exponential service time, Poisson's input with Erlang's service time, deterministic and general distributions. There are shown formulas for average waiting time in queue, average number of requests in queue and in the system. In practical part are illustrated examples for some models, which were described. The main characteristics of the queuing system are mentioned in the first chapter of this work.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English