This HTML5 document contains 43 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n12http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n22http://purl.org/net/nknouf/ns/bibtex#
n8http://localhost/temp/predkladatel/
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n17http://linked.opendata.cz/resource/domain/vavai/subjekt/
n16http://linked.opendata.cz/ontology/domain/vavai/
n11https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
rdfshttp://www.w3.org/2000/01/rdf-schema#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989100%3A27230%2F13%3A86087662%21RIV14-MSM-27230___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n20http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989100%3A27230%2F13%3A86087662%21RIV14-MSM-27230___
rdf:type
skos:Concept n16:Vysledek
rdfs:seeAlso
https://mme2013.vspj.cz/about-conference/conference-proceedings
dcterms:description
The paper deals with modelling and simulation of a finite single-server queueing system with a server subject to breakdowns. We consider that customers come to the queueing system in the Poisson stream. Customers incoming to the system are served according to the FCFS discipline, service times are considered to follow the Erlang distribution defined by the shape parameter and the scale parameter. Customers can wait for the service in the queue which length is limited by (m-1) places, that means the total capacity of the queueing system is equal to m places. Further, we assume that the server can break down. Breakdowns of the server are considered to be non-preemptive that means when a breakdown occurs during customer servicing it is possible to finish it before server repair is started. Times between breakdowns and repair times are assumed to follow the exponential distribution. We model the queue as a quasi-birth death process for which we present steady-state diagram and equation system describing the system behaviour in the steady-state. Solving the equation system in Matlab we get stationary probabilities which are used for computing basic performance measures. The mathematical model is supported by a simulation model in order to validate the outcomes of the mathematical model. The paper deals with modelling and simulation of a finite single-server queueing system with a server subject to breakdowns. We consider that customers come to the queueing system in the Poisson stream. Customers incoming to the system are served according to the FCFS discipline, service times are considered to follow the Erlang distribution defined by the shape parameter and the scale parameter. Customers can wait for the service in the queue which length is limited by (m-1) places, that means the total capacity of the queueing system is equal to m places. Further, we assume that the server can break down. Breakdowns of the server are considered to be non-preemptive that means when a breakdown occurs during customer servicing it is possible to finish it before server repair is started. Times between breakdowns and repair times are assumed to follow the exponential distribution. We model the queue as a quasi-birth death process for which we present steady-state diagram and equation system describing the system behaviour in the steady-state. Solving the equation system in Matlab we get stationary probabilities which are used for computing basic performance measures. The mathematical model is supported by a simulation model in order to validate the outcomes of the mathematical model.
dcterms:title
On finite single-server queue subject to non-preemptive breakdowns On finite single-server queue subject to non-preemptive breakdowns
skos:prefLabel
On finite single-server queue subject to non-preemptive breakdowns On finite single-server queue subject to non-preemptive breakdowns
skos:notation
RIV/61989100:27230/13:86087662!RIV14-MSM-27230___
n16:predkladatel
n17:orjk%3A27230
n3:aktivita
n10:S
n3:aktivity
S
n3:dodaniDat
n20:2014
n3:domaciTvurceVysledku
n14:6860273 n14:7604335
n3:druhVysledku
n15:D
n3:duvernostUdaju
n7:S
n3:entitaPredkladatele
n13:predkladatel
n3:idSjednocenehoVysledku
93710
n3:idVysledku
RIV/61989100:27230/13:86087662
n3:jazykVysledku
n18:eng
n3:klicovaSlova
non-preemptive failures; method of stages; queue; M/En/1/m
n3:klicoveSlovo
n4:M%2FEn%2F1%2Fm n4:queue n4:non-preemptive%20failures n4:method%20of%20stages
n3:kontrolniKodProRIV
[832CAC97D3D5]
n3:mistoKonaniAkce
Jihlava
n3:mistoVydani
Jihlava
n3:nazevZdroje
Mathematical Methods in Economics 2013 : 31st international conference : 11-13 September 2013, Jihlava, Czech Republic
n3:obor
n21:BB
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:rokUplatneniVysledku
n20:2013
n3:tvurceVysledku
Dorda, Michal Teichmann, DuĊĦan
n3:typAkce
n12:EUR
n3:zahajeniAkce
2013-09-11+02:00
s:numberOfPages
6
n22:hasPublisher
College of Polytechnics Jihlava
n11:isbn
978-80-87035-76-4
n8:organizacniJednotka
27230