IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-00465145.html
   My bibliography  Save this paper

Optimal server assignment for a multiple customer classes problem

Author

Listed:
  • Laoucine Kerbache

    (GREGH - Groupement de Recherche et d'Etudes en Gestion à HEC - HEC Paris - Ecole des Hautes Etudes Commerciales - CNRS - Centre National de la Recherche Scientifique)

  • Mario Norbis
  • Jose A. Gonzalez

Abstract

The problem of assigning identical servers to different customer classes with the objectives of optimizing customer service and resource utilization is analysed. The problem that motivated this research is the assignment of batch jobs in a computer centre running the operating system MVS (Multiple Virtual Storage). A mathematical formulation of the problem is presented and its computational complexity discussed. A new schema for the definition of customer classes and a heuristic for the assignment of servers to classes are developed and applied to the problem. Numerical results show the efficiency of the procedure as compared with other previously utilized methods. The final part of the paper presents the conclusions and recommendations for further research.

Suggested Citation

  • Laoucine Kerbache & Mario Norbis & Jose A. Gonzalez, 2004. "Optimal server assignment for a multiple customer classes problem," Post-Print hal-00465145, HAL.
    • Handle: RePEc:hal:journl:hal-00465145
    DOI: 10.1093/imaman/15.3.195
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Morabito, Reinaldo & de Souza, Mauricio C. & Vazquez, Mariana, 2014. "Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks," European Journal of Operational Research, Elsevier, vol. 232(3), pages 618-629.

    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:hal:journl:hal-00465145. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.