Rodyti trumpą aprašą

dc.contributor.authorTanackov, Ilija
dc.contributor.authorPrentkovskis, Olegas
dc.contributor.authorJevtić, Žarko
dc.contributor.authorStojić, Gordan
dc.contributor.authorErcegovac, Pamela
dc.date.accessioned2023-09-18T18:48:23Z
dc.date.available2023-09-18T18:48:23Z
dc.date.issued2019
dc.identifier.urihttps://etalpykla.vilniustech.lt/handle/123456789/131922
dc.description.abstractThis manuscript starts with a detailed analysis of the current solution for the queueing system M/Er/1/∞. In the existing solution, Erlang’s service is caused by Poisson’s arrival process of groups, but not individual clients. The service of individual clients is still exponentially distributed, contrary to the declaration in Kendall’s notation. From the related theory of the Hidden Markov Model (HMM), for the advancement of queueing theory, the idea of “hidden Markov states” (HMS) was taken. In this paper, the basic principles of application of HMS have first been established. The abstract HMS states have a catalytic role in the standard procedure of solving the non-Markovian queueing systems. The proposed solution based on HMS exceeds the problem of accessing identical client groups in the current solution of the M/Er/r queueing system. A detailed procedure for the new solution of the queueing system M/Er/1/∞ is implemented. Additionally, a new solution to the queueing system M/N/1/∞ with a normal service time N(μ, σ) based on HMS is also implemented.eng
dc.formatPDF
dc.format.extentp. 1-11
dc.format.mediumtekstas / txt
dc.language.isoeng
dc.relation.isreferencedbyMatSciNet
dc.relation.isreferencedbyGenamics Journal Seek
dc.relation.isreferencedbyEI Compendex Plus
dc.relation.isreferencedbyDOAJ
dc.relation.isreferencedbyINSPEC
dc.relation.isreferencedbyScopus
dc.relation.isreferencedbyEmerging Sources Citation Index (Web of Science)
dc.source.urihttps://doi.org/10.3390/a12070133
dc.source.urihttps://www.mdpi.com/1999-4893/12/7/133
dc.titleA new method for Markovian adaptation of the Non-Markovian queueing system using the hidden Markov model
dc.typeStraipsnis Web of Science DB / Article in Web of Science DB
dcterms.accessRightsThis is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
dcterms.references25
dc.type.pubtypeS1 - Straipsnis Web of Science DB / Web of Science DB article
dc.contributor.institutionUniversity of Novi Sad
dc.contributor.institutionVilniaus Gedimino technikos universitetas
dc.contributor.facultyTransporto inžinerijos fakultetas / Faculty of Transport Engineering
dc.subject.researchfieldT 003 - Transporto inžinerija / Transport engineering
dc.subject.researchfieldS 003 - Vadyba / Management
dc.subject.vgtuprioritizedfieldsTD0303 - Žalioji logistika, tarptautiniai transporto koridoriai / Green logistics and international transport corridors
dc.subject.ltspecializationsL106 - Transportas, logistika ir informacinės ir ryšių technologijos (IRT) / Transport, logistic and information and communication technologies
dc.subject.enqueueing
dc.subject.enErlang
dc.subject.enhidden
dc.subject.enMarkovian
dc.subject.encatalytic
dcterms.sourcetitleAlgorithms
dc.description.issueiss. 7
dc.description.volumevol. 12
dc.publisher.nameMDPI
dc.publisher.cityBasel
dc.identifier.doi2-s2.0-85069808371
dc.identifier.doi000478578100020
dc.identifier.doi10.3390/a12070133
dc.identifier.elaba39534145


Šio įrašo failai

Thumbnail

Šis įrašas yra šioje (-se) kolekcijoje (-ose)

Rodyti trumpą aprašą