Advanced Search
MyIDEAS: Login

Method for Throughput Maximization of Multiclass Networks with Flexible Servers

Contents:

Author Info

  • Naumov, Valeriy
  • Martikainen, Olli
Registered author(s):

    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.

    Download Info

    If 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.
    File URL: http://www.etla.fi/wp-content/uploads/2012/09/dp1261.pdf
    Download Restriction: no

    Bibliographic Info

    Paper provided by The Research Institute of the Finnish Economy in its series Discussion Papers with number 1261.

    as in new window
    Length: 22 pages
    Date of creation: 2011
    Date of revision:
    Handle: RePEc:rif:dpaper:1261

    Contact details of provider:
    Postal: Lönnrotinkatu 4 B, FIN-00120 HELSINKI
    Phone: +358 (0)9 609 900
    Fax: +358 (0)9 601 753
    Web page: http://www.etla.fi/
    More information through EDIRC

    Order Information:
    Email:

    Related research

    Keywords: server allocation; flexible server; multiclass network; throughput; bottleneck;

    This paper has been announced in the following NEP Reports:

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Down, Douglas G. & Karakostas, George, 2008. "Maximizing throughput in queueing networks with limited flexibility," European Journal of Operational Research, Elsevier, vol. 187(1), pages 98-112, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Naumov, Valeriy & Martikainen, Olli, 2011. "Optimal Resource Allocation in Multiclass Networks," Discussion Papers 1262, The Research Institute of the Finnish Economy.
    2. 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.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:rif:dpaper:1261. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Kaija Hyvönen-Rajecki).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.