M/M/c/K 대기행렬 시스템의 바쁜 기간 분석A Busy Period Analysis for the M/M/c/K Queueing System

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 845
  • Download : 0
DC FieldValueLanguage
dc.contributor.author채경철ko
dc.contributor.author임대은ko
dc.date.accessioned2013-03-06T19:00:23Z-
dc.date.available2013-03-06T19:00:23Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2006-03-
dc.identifier.citation한국경영과학회지, v.31, no.1, pp.83 - 90-
dc.identifier.issn1225-1119-
dc.identifier.urihttp://hdl.handle.net/10203/88054-
dc.description.abstractBy defining the partial busy period of the M/M/c/K queueing system as the time interval during which at least one server is in service, we derive the first two moments of both the partial busy period and the number of customers served during it. All expressions are given in explicit forms.-
dc.languageKorean-
dc.publisher한국경영과학회-
dc.titleM/M/c/K 대기행렬 시스템의 바쁜 기간 분석-
dc.title.alternativeA Busy Period Analysis for the M/M/c/K Queueing System-
dc.typeArticle-
dc.type.rimsART-
dc.citation.volume31-
dc.citation.issue1-
dc.citation.beginningpage83-
dc.citation.endingpage90-
dc.citation.publicationname한국경영과학회지-
dc.identifier.kciidART001001796-
dc.contributor.localauthor채경철-
dc.contributor.nonIdAuthor임대은-
dc.subject.keywordAuthorMultiserver Queue-
dc.subject.keywordAuthorFinite Queue-
dc.subject.keywordAuthorPartial Busy Period-
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0