Method for Throughput Maximization of Multiclass Networks with Flexible Servers
AbstractIn 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by The Research Institute of the Finnish Economy in its series Discussion Papers with number 1261.
Length: 22 pages
Date of creation: 2011
Date of revision:
This paper has been announced in the following NEP Reports:
- NEP-ALL-2011-12-19 (All new papers)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Naumov, Valeriy & Martikainen, Olli, 2011. "Optimal Resource Allocation in Multiclass Networks," Discussion Papers 1262, The Research Institute of the Finnish Economy.
- Kauhanen, Antti & Kulvik, Martti & Kulvik, Silja & Maijanen, Sirpa & Martikainen, Olli & Ranta, Paula, 2013. "Resource allocation in health care processes: A case study," ETLA Working Papers 10, The Research Institute of the Finnish Economy.
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.