Arbeitspapier

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.

Language
Englisch

Bibliographic citation
Series: ETLA Discussion Papers ; No. 1261

Classification
Wirtschaft
Optimization Techniques; Programming Models; Dynamic Analysis
Existence and Stability Conditions of Equilibrium
Computable General Equilibrium Models
Subject
server allocation
flexible server
multiclass network
throughput
bottleneck
Unternehmensarchitektur
Dynamische Optimierung
Allgemeines Gleichgewicht
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:43 AM CET

Data provider

This object is provided by:
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

Other Objects (12)