About: On finite single-server queue subject to non-preemptive breakdowns     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
rdfs:seeAlso
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. (en)
Title
  • On finite single-server queue subject to non-preemptive breakdowns
  • On finite single-server queue subject to non-preemptive breakdowns (en)
skos:prefLabel
  • On finite single-server queue subject to non-preemptive breakdowns
  • On finite single-server queue subject to non-preemptive breakdowns (en)
skos:notation
  • RIV/61989100:27230/13:86087662!RIV14-MSM-27230___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • S
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 93710
http://linked.open...ai/riv/idVysledku
  • RIV/61989100:27230/13:86087662
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • non-preemptive failures; method of stages; queue; M/En/1/m (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [832CAC97D3D5]
http://linked.open...v/mistoKonaniAkce
  • Jihlava
http://linked.open...i/riv/mistoVydani
  • Jihlava
http://linked.open...i/riv/nazevZdroje
  • Mathematical Methods in Economics 2013 : 31st international conference : 11-13 September 2013, Jihlava, Czech Republic
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Dorda, Michal
  • Teichmann, Dušan
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • College of Polytechnics Jihlava
https://schema.org/isbn
  • 978-80-87035-76-4
http://localhost/t...ganizacniJednotka
  • 27230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 47 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software