Please use this identifier to cite or link to this item:
https://hdl.handle.net/11499/6321
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ekren, B.Y. | - |
dc.contributor.author | Heragu, Sunderesh S. | - |
dc.date.accessioned | 2019-08-16T12:05:57Z | |
dc.date.available | 2019-08-16T12:05:57Z | |
dc.date.issued | 2010 | - |
dc.identifier.issn | 0377-2217 | - |
dc.identifier.uri | https://hdl.handle.net/11499/6321 | - |
dc.identifier.uri | https://doi.org/10.1016/j.ejor.2010.01.022 | - |
dc.description.abstract | In this paper, we present an approximate method for solution of load-dependent, closed queuing networks having general service time distributions with low variability. The proposed technique is an extension of Marie's (1980) method. In the methodology, conditional throughputs are obtained by an iterative procedure. The iterations are repeated until an invalid result is detected or no improvements are found. We demonstrate the performance of the technique with 10 different examples. On average, the solutions have 5% or lower deviations when compared to simulation results. © 2010 Elsevier B.V. All rights reserved. | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartof | European Journal of Operational Research | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Conditional throughput | en_US |
dc.subject | Load-dependent network | en_US |
dc.subject | Performance analysis | en_US |
dc.subject | Queuing networks | en_US |
dc.subject | Approximate analysis | en_US |
dc.subject | Approximate methods | en_US |
dc.subject | Closed queuing network | en_US |
dc.subject | Distributed queuing | en_US |
dc.subject | Iterative procedures | en_US |
dc.subject | Network performance analysis | en_US |
dc.subject | Queuing network | en_US |
dc.subject | Service time | en_US |
dc.subject | Service time distribution | en_US |
dc.subject | Simulation result | en_US |
dc.subject | Approximation theory | en_US |
dc.subject | Queueing networks | en_US |
dc.subject | Throughput | en_US |
dc.subject | Queueing theory | en_US |
dc.title | Approximate analysis of load-dependent generally distributed queuing networks with low service time variability | en_US |
dc.type | Article | en_US |
dc.identifier.volume | 205 | en_US |
dc.identifier.issue | 2 | en_US |
dc.identifier.startpage | 381 | |
dc.identifier.startpage | 381 | en_US |
dc.identifier.endpage | 389 | en_US |
dc.identifier.doi | 10.1016/j.ejor.2010.01.022 | - |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopus | 2-s2.0-76949097887 | en_US |
dc.identifier.wos | WOS:000276030200016 | en_US |
dc.identifier.scopusquality | Q1 | - |
dc.owner | Pamukkale University | - |
item.fulltext | No Fulltext | - |
item.languageiso639-1 | en | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
Appears in Collections: | Mühendislik Fakültesi Koleksiyonu Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
CORE Recommender
SCOPUSTM
Citations
21
checked on Nov 23, 2024
WEB OF SCIENCETM
Citations
18
checked on Nov 24, 2024
Page view(s)
22
checked on Aug 24, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.