Abstract
In this article, we study the problem of locating a server on a tree network that operates as a FIFO M/G/1 queue. The goal is to identify sets of efficient facility locations with respect to moments of the response time. The results are illustrated via an example. © 1993 by John Wiley & Sons, Inc.
| Original language | English |
|---|---|
| Pages (from-to) | 597-603 |
| Number of pages | 7 |
| Journal | Networks |
| Volume | 23 |
| Issue number | 7 |
| DOIs | |
| State | Published - Oct 1993 |
Fingerprint
Dive into the research topics of 'Determining efficient facility locations on a tree network operating as a FIFO M/G/1 queue'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver