Detailed Information

Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads

Optimization of the M/M/1 queue with impatient customers

Full metadata record
DC Field Value Language
dc.contributor.authorLim, Kyung-Eun-
dc.contributor.authorLee, Eui-Yong-
dc.date.accessioned2023-12-18T08:00:42Z-
dc.date.available2023-12-18T08:00:42Z-
dc.date.issued2002-12-
dc.identifier.issn1598-0073-
dc.identifier.issn2283-8914-
dc.identifier.urihttps://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/159139-
dc.description.abstractAn optimization of the M/M/1 queue with impatient customers is studied. The impatient customer does not enter the system if his or her virtual waiting time exceeds the threshold K > 0. After assigning three costs to the system, a cost proportional to the virtual waiting time, a penalty to each impatient customer, and also a penalty to each unit of the idle period of the server, we show that there exists a threshold K which minimizes the long-run average cost per unit time.-
dc.format.extent7-
dc.language영어-
dc.language.isoENG-
dc.publisher한국신뢰성학회-
dc.titleOptimization of the M/M/1 queue with impatient customers-
dc.typeArticle-
dc.publisher.location대한민국-
dc.identifier.bibliographicCitationInternational Journal of Reliability and Applications, v.3, no.4, pp 165 - 171-
dc.citation.titleInternational Journal of Reliability and Applications-
dc.citation.volume3-
dc.citation.number4-
dc.citation.startPage165-
dc.citation.endPage171-
dc.description.isOpenAccessN-
dc.description.journalRegisteredClassdomestic-
dc.identifier.urlhttps://koreascience.kr/article/JAKO200211921705646.page?&lang=ko-
Files in This Item
Go to Link
Appears in
Collections
이과대학 > 통계학과 > 1. Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetrics

Total Views & Downloads

BROWSE