Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/156317
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorRovira Escofet, Carles-
dc.contributor.authorTresserras Pujadas, Lluc-
dc.date.accessioned2020-04-21T08:19:38Z-
dc.date.available2020-04-21T08:19:38Z-
dc.date.issued2019-06-20-
dc.identifier.urihttps://hdl.handle.net/2445/156317-
dc.descriptionTreballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2019, Director: Carles Rovira Escofetca
dc.description.abstract[en] As we know queues are a common every-day experience. Queueing theory is the mathematical study of waiting lines or queues of a system. This work first of all gives a brief introduccion of Markov process, birth-death process, and study some of the most important queueing models, such as the M/M/1 queue. Then deals with queueing networks to see how different queues act when they are interconnected. Finally, it shows a simulation of a simple queueing model with the aim of checking the analytic results observed.ca
dc.format.extent56 p.-
dc.format.mimetypeapplication/pdf-
dc.language.isocatca
dc.rightscc-by-nc-nd (c) Lluc Tresserras Pujadas, 2019-
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/*
dc.sourceTreballs Finals de Grau (TFG) - Matemàtiques-
dc.subject.classificationTeoria de cuesca
dc.subject.classificationTreballs de fi de grau-
dc.subject.classificationProcessos de Markovca
dc.subject.classificationTeoria de sistemesca
dc.subject.otherQueuing theoryen
dc.subject.otherBachelor's theses-
dc.subject.otherMarkov processesen
dc.subject.otherSystem theoryen
dc.titleTeoria de cuesca
dc.typeinfo:eu-repo/semantics/bachelorThesisca
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessca
Appears in Collections:Treballs Finals de Grau (TFG) - Matemàtiques

Files in This Item:
File Description SizeFormat 
156317.pdfMemòria504.09 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons