Optimal buffer allocation in finite closed networks with multiple servers

dc.contributor.authorYuzukirmizi, Mustafa
dc.contributor.authorSmith, J. MacGregor
dc.date.accessioned2020-06-25T17:44:26Z
dc.date.available2020-06-25T17:44:26Z
dc.date.issued2008
dc.departmentKırıkkale Üniversitesi
dc.description.abstractIn this study, we present an optimal buffer allocation procedure for closed queueing networks with finite buffers. The performance measures are evaluated using the expanded mean value analysis, and the solution procedure is incorporated into a nonlinear optimization scheme to arrive at the sub-optimal buffer space vector. The effectiveness of the method is demonstrated through several numerical experiments. Discussions on convergence and computational complexity are also included. (C) 2007 Elsevier Ltd. All rights reserved.en_US
dc.identifier.citationclosedAccessen_US
dc.identifier.doi10.1016/j.cor.2006.12.008
dc.identifier.endpage2598en_US
dc.identifier.issn0305-0548
dc.identifier.issue8en_US
dc.identifier.scopus2-s2.0-36849080859
dc.identifier.scopusqualityQ1
dc.identifier.startpage2579en_US
dc.identifier.urihttps://doi.org/10.1016/j.cor.2006.12.008
dc.identifier.urihttps://hdl.handle.net/20.500.12587/4106
dc.identifier.volume35en_US
dc.identifier.wosWOS:000253254500012
dc.identifier.wosqualityQ1
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherPergamon-Elsevier Science Ltden_US
dc.relation.ispartofComputers & Operations Research
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectfinite closed queueing networksen_US
dc.subjectcombinatorial optimizationen_US
dc.titleOptimal buffer allocation in finite closed networks with multiple serversen_US
dc.typeArticle

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
[ X ]
İsim:
Optimal buffer allocation in finite closed networks with multiple servers.pdf
Boyut:
272.94 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin/Full Text