Allocation of buffer capacities in queueing networks with arbitrary topologies
Yazarlar (2)
Hideaki Yamashita Sophia University, Japonya
Prof. Dr. Oruç Raif ÖNVURAL Maltepe Üniversitesi, Türkiye
Makale Türü Özgün Makale (SSCI, AHCI, SCI, SCI-Exp dergilerinde yayınlanan tam makale)
Dergi Adı Annals of Operations Research (Q4)
Dergi ISSN 0254-5330 Wos Dergi Scopus Dergi
Dergi Tarandığı Indeksler SCI
Makale Dili İngilizce Basım Tarihi 01-1994
Cilt / Sayı / Sayfa 48 / 4 / 313–332 DOI 10.1007/BF02024519
Makale Linki http://link.springer.com/10.1007/BF02024519
UAK Araştırma Alanları
Bilgisayar ve İletişim Ağları
Özet
Two algorithms are developed to allocateM buffers toN service stations connected arbitrarily in a feed-forward manner. All service times and the interarrival times are assumed to be exponentially distributed. Both methodologies are easy-to-use tools to explore alternative buffer storage configurations and parameter settings during the initial design stages of production systems, communications networks, and flexible manufacturing systems.
Anahtar Kelimeler
blocking | heuristics | open queueing networks | Optimization
BM Sürdürülebilir Kalkınma Amaçları
Atıf Sayıları
Web of Science 7
Scopus 10
Google Scholar 30
Allocation of buffer capacities in queueing networks with arbitrary topologies

Paylaş