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.
- Sprache
-
Englisch
- Erschienen in
-
Series: ETLA Discussion Papers ; No. 1262
- Klassifikation
-
Wirtschaft
Optimization Techniques; Programming Models; Dynamic Analysis
Existence and Stability Conditions of Equilibrium
Computable General Equilibrium Models
- Thema
-
resource allocation
flexible server
multiclass network
throughput
bottleneck
Unternehmensarchitektur
Allgemeines Gleichgewicht
Mathematische Optimierung
Theorie
- Ereignis
-
Geistige Schöpfung
- (wer)
-
Naumov, Valeriy
Martikainen, Olli
- Ereignis
-
Veröffentlichung
- (wer)
-
The Research Institute of the Finnish Economy (ETLA)
- (wo)
-
Helsinki
- (wann)
-
2011
- Handle
- Letzte Aktualisierung
-
10.03.2025, 11:44 MEZ
Datenpartner
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Arbeitspapier
Beteiligte
- Naumov, Valeriy
- Martikainen, Olli
- The Research Institute of the Finnish Economy (ETLA)
Entstanden
- 2011