Method for Throughput Maximization of Multiclass Networks with Flexible Servers
In this paper, we study the throughput of multiclass networks featuring several types of flexible servers as well as general constraints both on the number of servers having the same skills and on the number of servers allowed at each station. Each job class is characterized by its processing station, and each station is characterized by the amount of work assigned to that station upon job arrival. Servers may have different skills and efficiencies. We propose a simple method calculating an upper bound for the maximum network throughput achievable with static server allocation.
|Date of creation:||2011|
|Contact details of provider:|| Postal: Lönnrotinkatu 4 B, FIN-00120 HELSINKI|
Phone: +358 (0)9 609 900
Fax: +358 (0)9 601 753
Web page: http://www.etla.fi/
More information through EDIRC
|Order Information:|| Email: |
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Down, Douglas G. & Karakostas, George, 2008. "Maximizing throughput in queueing networks with limited flexibility," European Journal of Operational Research, Elsevier, vol. 187(1), pages 98-112, May.
When requesting a correction, please mention this item's handle: RePEc:rif:dpaper:1261. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Kaija Hyvönen-Rajecki)
If references are entirely missing, you can add them using this form.