Non-preemptive priority M/M/m queue with servers’ vacations
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, B. | - |
dc.contributor.author | Kim, J. | - |
dc.contributor.author | Bueker, O. | - |
dc.date.accessioned | 2022-02-17T12:40:52Z | - |
dc.date.available | 2022-02-17T12:40:52Z | - |
dc.date.created | 2022-02-09 | - |
dc.date.issued | 2021-10 | - |
dc.identifier.issn | 0360-8352 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/136102 | - |
dc.description.abstract | We consider a non-preemptive priority M/M/m queue with two classes of customers and multiple vacations. Service times for all customers are exponentially distributed with the same mean, and vacation times follow an exponential distribution. We obtain the vector probability generating function for the stationary distribution of the number of customers in the queue for each class. This is established by deriving a matrix equation for the vector probability generating function of the stationary distribution of the censored Markov process and then studying the analytical properties of the matrix generating function. We also obtain exact expressions for the first two moments of the number of customers in the queue for each class. Finally, as an application, we investigate a customer's equilibrium strategy and the optimal priority fee associated with social cost minimization for an unobservable M/M/m queue with two priority classes and multiple vacations. © 2021 Elsevier Ltd | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | Elsevier Ltd | - |
dc.title | Non-preemptive priority M/M/m queue with servers’ vacations | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, B. | - |
dc.identifier.doi | 10.1016/j.cie.2021.107390 | - |
dc.identifier.scopusid | 2-s2.0-85112010864 | - |
dc.identifier.wosid | 000745779600002 | - |
dc.identifier.bibliographicCitation | Computers and Industrial Engineering, v.160 | - |
dc.relation.isPartOf | Computers and Industrial Engineering | - |
dc.citation.title | Computers and Industrial Engineering | - |
dc.citation.volume | 160 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.relation.journalWebOfScienceCategory | Engineering, Industrial | - |
dc.subject.keywordPlus | INVERSION | - |
dc.subject.keywordAuthor | Censored markov process | - |
dc.subject.keywordAuthor | Equilibrium strategy | - |
dc.subject.keywordAuthor | Non-preemptive priority queue | - |
dc.subject.keywordAuthor | Server vacation | - |
dc.subject.keywordAuthor | Social cost | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea 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.