Optimization of the M/M/1 queue with impatient customers
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lim, Kyung-Eun | - |
dc.contributor.author | Lee, Eui-Yong | - |
dc.date.accessioned | 2023-12-18T08:00:42Z | - |
dc.date.available | 2023-12-18T08:00:42Z | - |
dc.date.issued | 2002-12 | - |
dc.identifier.issn | 1598-0073 | - |
dc.identifier.issn | 2283-8914 | - |
dc.identifier.uri | https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/159139 | - |
dc.description.abstract | An 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.extent | 7 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | 한국신뢰성학회 | - |
dc.title | Optimization of the M/M/1 queue with impatient customers | - |
dc.type | Article | - |
dc.publisher.location | 대한민국 | - |
dc.identifier.bibliographicCitation | International Journal of Reliability and Applications, v.3, no.4, pp 165 - 171 | - |
dc.citation.title | International Journal of Reliability and Applications | - |
dc.citation.volume | 3 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 165 | - |
dc.citation.endPage | 171 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | domestic | - |
dc.identifier.url | https://koreascience.kr/article/JAKO200211921705646.page?&lang=ko | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Sookmyung Women's University. Cheongpa-ro 47-gil 100 (Cheongpa-dong 2ga), Yongsan-gu, Seoul, 04310, Korea02-710-9127
Copyright©Sookmyung Women's University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.