Arbeitspapier
Optimal resource allocation in multiclass networks
In this paper, we study resource allocation in multiclass networks having several types of flexible servers and general constraints on the number of servers at each station. Each job class is characterized by the station where the job is processed and by the amount of work allocated to that station upon job arrival. Servers may have different skills, working efficiency and resource requirements. We propose a simple method to calculate an upper bound for the maximum network throughput achievable with static resource allocation.
- Language
-
Englisch
- Bibliographic citation
-
Series: ETLA Discussion Papers ; No. 1262
- Classification
-
Wirtschaft
Optimization Techniques; Programming Models; Dynamic Analysis
Existence and Stability Conditions of Equilibrium
Computable General Equilibrium Models
- Subject
-
resource allocation
flexible server
multiclass network
throughput
bottleneck
Unternehmensarchitektur
Allgemeines Gleichgewicht
Mathematische Optimierung
Theorie
- Event
-
Geistige Schöpfung
- (who)
-
Naumov, Valeriy
Martikainen, Olli
- Event
-
Veröffentlichung
- (who)
-
The Research Institute of the Finnish Economy (ETLA)
- (where)
-
Helsinki
- (when)
-
2011
- Handle
- Last update
-
10.03.2025, 11:44 AM CET
Data provider
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
Object type
- Arbeitspapier
Associated
- Naumov, Valeriy
- Martikainen, Olli
- The Research Institute of the Finnish Economy (ETLA)
Time of origin
- 2011