A simple approximation method for workload analyses in some queueing systems with control policies
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hur, Sun | - |
dc.contributor.author | Lee, Hyungjoong | - |
dc.contributor.author | Kim, Seongho | - |
dc.date.accessioned | 2021-06-23T21:37:14Z | - |
dc.date.available | 2021-06-23T21:37:14Z | - |
dc.date.created | 2021-01-21 | - |
dc.date.issued | 2006-09 | - |
dc.identifier.issn | 0360-8352 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/44702 | - |
dc.description.abstract | We consider two systems: M/G/1 with a finite workload capacity and an infinite dam model under P-lambda(M) policy. It is necessary to analyze the workload processes for these systems, which is mostly difficult and complex. An efficient and easy approximation procedure for these systems is provided. Our method is based on the idea that the service time of a customer can be approximated as the sum of small deterministic service times of a batch of customers. This enables us to work with system size processes instead of workload processes. The proposed method turns out to be in excellent agreement with simulation results and exact solution. (c) 2006 Elsevier Ltd. All rights reserved. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.title | A simple approximation method for workload analyses in some queueing systems with control policies | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Hur, Sun | - |
dc.contributor.affiliatedAuthor | Kim, Seongho | - |
dc.identifier.doi | 10.1016/j.cie.2006.07.010 | - |
dc.identifier.scopusid | 2-s2.0-33749043735 | - |
dc.identifier.wosid | 000241654100018 | - |
dc.identifier.bibliographicCitation | COMPUTERS & INDUSTRIAL ENGINEERING, v.51, no.1, pp.183 - 195 | - |
dc.relation.isPartOf | COMPUTERS & INDUSTRIAL ENGINEERING | - |
dc.citation.title | COMPUTERS & INDUSTRIAL ENGINEERING | - |
dc.citation.volume | 51 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 183 | - |
dc.citation.endPage | 195 | - |
dc.type.rims | ART | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
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 | FINITE | - |
dc.subject.keywordPlus | P-LAMBDA(M)-POLICY | - |
dc.subject.keywordPlus | DAM | - |
dc.subject.keywordAuthor | M/G/1 | - |
dc.subject.keywordAuthor | P-lambda(M) policy | - |
dc.subject.keywordAuthor | finite capacity | - |
dc.subject.keywordAuthor | workload | - |
dc.subject.keywordAuthor | discretization | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0360835206000751?via%3Dihub | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG 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.