Next Article in Journal
An Enhanced Lightning Attachment Procedure Optimization Algorithm
Next Article in Special Issue
Bi-Level Multi-Objective Production Planning Problem with Multi-Choice Parameters: A Fuzzy Goal Programming Algorithm
Previous Article in Journal
Drum Water Level Control Based on Improved ADRC
Previous Article in Special Issue
The Role of Façade Materials in Blast-Resistant Buildings: An Evaluation Based on Fuzzy Delphi and Fuzzy EDAS
Article Menu
Issue 7 (July) cover image

Export Article

Open AccessArticle

A New Method for Markovian Adaptation of the Non-Markovian Queueing System Using the Hidden Markov Model

Faculty of Technical Sciences, University of Novi Sad, TrgDositejaObradovi’ca 6, 21 000 Novi Sad, Serbia
Department of Mobile Machinery and Railway Transport, Faculty of Transport Engineering, Vilnius Gediminas Technical University, Plytinėsg.27, LT-10105 Vilnius, Lithuania
Author to whom correspondence should be addressed.
These authors contributed equally to this paper.
Algorithms 2019, 12(7), 133;
Received: 27 May 2019 / Revised: 21 June 2019 / Accepted: 25 June 2019 / Published: 28 June 2019
(This article belongs to the Special Issue Algorithms for Multi-Criteria Decision-Making)
PDF [2073 KB, uploaded 2 July 2019]


This 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. View Full-Text
Keywords: queueing; Erlang; hidden; Markovian; catalytic queueing; Erlang; hidden; Markovian; catalytic

Figure 1

This 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).

Share & Cite This Article

MDPI and ACS Style

Tanackov, I.; Prentkovskis, O.; Jevtić, Ž.; Stojić, G.; Ercegovac, P. A New Method for Markovian Adaptation of the Non-Markovian Queueing System Using the Hidden Markov Model. Algorithms 2019, 12, 133.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top