IDEAS home Printed from https://ideas.repec.org/p/rif/dpaper/1261.html
   My bibliography  Save this paper

Method for Throughput Maximization of Multiclass Networks with Flexible Servers

Author

Listed:
  • Naumov, Valeriy
  • Martikainen, Olli

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.

Suggested Citation

  • Naumov, Valeriy & Martikainen, Olli, 2011. "Method for Throughput Maximization of Multiclass Networks with Flexible Servers," Discussion Papers 1261, The Research Institute of the Finnish Economy.
  • Handle: RePEc:rif:dpaper:1261
    as

    Download full text from publisher

    File URL: http://www.etla.fi/wp-content/uploads/2012/09/dp1261.pdf
    Download Restriction: no

    References listed on IDEAS

    as
    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


    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.

    More about this item

    Keywords

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

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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). General contact details of provider: http://edirc.repec.org/data/etlaafi.html .

    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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.