Tightening Throughput Bounds for Finite Tandem Queues via Duality

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 570
  • Download : 383
DC FieldValueLanguage
dc.contributor.authorTcha, Dong-Wanko
dc.contributor.authorLee, Won-taekko
dc.date.accessioned2008-06-12T07:18:21Z-
dc.date.available2008-06-12T07:18:21Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued1990-
dc.identifier.citation한국경영과학회지, v.15, no.2, pp.63 - 69-
dc.identifier.issn1225-1100-
dc.identifier.urihttp://hdl.handle.net/10203/5048-
dc.descriptionThis article is confirmed to be submitted through the review and edition of the Korean Operations Research and Management Science Society. Please enter the title (Journal/Proceedings), volume, number, and pages properly when citing the article.en
dc.description.abstractThis note shows that the throughput bounds for two-stage tandem queueing systems with finite buffers, obtained by the existing methods, can significantly be tightened via duality-
dc.languageKorean-
dc.language.isoen_USen
dc.publisher한국경영과학회-
dc.titleTightening Throughput Bounds for Finite Tandem Queues via Duality-
dc.typeArticle-
dc.type.rimsART-
dc.citation.volume15-
dc.citation.issue2-
dc.citation.beginningpage63-
dc.citation.endingpage69-
dc.citation.publicationname한국경영과학회지-
dc.embargo.liftdate9999-12-31-
dc.embargo.terms9999-12-31-
dc.contributor.localauthorTcha, Dong-Wan-
dc.contributor.nonIdAuthorLee, Won-taek-
Appears in Collection
MT-Journal Papers(저널논문)
Files in This Item

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0