mdh.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
A Survey on Queueing Systems with Mathematical Models and Applications
Pulchowk Campus, Institute of Engineering, Tribhuvan University, Nepal.
Pulchowk Campus, Institute of Engineering, Tribhuvan University, Nepal.
Department of Mathematical Sciences, School of Science, Kathmandu University, Nepal.
Mälardalens högskola, Akademin för utbildning, kultur och kommunikation, Utbildningsvetenskap och Matematik. (MAM)ORCID-id: 0000-0003-4554-6528
2017 (Engelska)Ingår i: American Journal of Operational Research, ISSN 2324-6537, E-ISSN 2324-6545, ISSN 2324-6537, Vol. 7, nr 1, s. 1-14Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

Queuing systems consist of one or more servers that provide some sort of services to arriving customers. Almost everyone has some experience of tedious time being in a queue during several daily life activities. It is reasonable to accept that service should be provided to the one who arrives first in the queue. But this rule always may not work. Sometimes the last comer or the customer in the high priority gets service earlier than the one who is waiting in the queue for a long time. All these characteristics are the interesting areas of research in the queueing theory. In this paper, we present some of the previous works of various researchers with brief explanations. We then carry out some of the mathematical expressions which represent the different queueing behaviors. In almost all the literatures, these queueing behaviors are examined with the help of mathematical simulations. Based on the previous contributions of researchers, our specific point of attraction is to study the finite capacity queueing models in which limited number of customers are served by a single or multiple number of servers and the batch queueing models where arrival or service or both occur in a bulk. Furthermore, we present some performance measure equations of some queueing models together with necessary components used in the queueing theory. Finally, we report some applications of queueing systems in supply chain management pointing out some areas of research as further works.

Ort, förlag, år, upplaga, sidor
2017. Vol. 7, nr 1, s. 1-14
Nyckelord [en]
Queueing, Performance, Server, Customer, Capacity, Supply chain
Nationell ämneskategori
Beräkningsmatematik Sannolikhetsteori och statistik
Forskningsämne
matematik/tillämpad matematik
Identifikatorer
URN: urn:nbn:se:mdh:diva-36592OAI: oai:DiVA.org:mdh-36592DiVA, id: diva2:1145931
Tillgänglig från: 2017-09-30 Skapad: 2017-10-01 Senast uppdaterad: 2018-01-26Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Open Access to free full text

Personposter BETA

Silvestrov, Sergei

Sök vidare i DiVA

Av författaren/redaktören
Silvestrov, Sergei
Av organisationen
Utbildningsvetenskap och Matematik
I samma tidskrift
American Journal of Operational Research
BeräkningsmatematikSannolikhetsteori och statistik

Sök vidare utanför DiVA

GoogleGoogle Scholar

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 54 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf