Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/87790
Authors: 
Naumov, Valeriy
Martikainen, Olli
Year of Publication: 
2011
Series/Report no.: 
ETLA Discussion Papers, The Research Institute of the Finnish Economy (ETLA) 1261
Abstract: 
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.
Subjects: 
server allocation
flexible server
multiclass network
throughput
bottleneck
JEL: 
C61
C62
C68
Document Type: 
Working Paper

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.