Optimal server assignment for a multiple customer classes problem

Laoucine Kerbache (), Mario Norbis and Jose A. Gonzalez
Additional contact information
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

Post-Print from HAL

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.

Keywords: assignment problem; queuing; optimal scheduling (search for similar items in EconPapers)
Date: 2004-07
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Published in IMA Journal of Management Mathematics, 2004, 15 (3), pp.195-210. ⟨10.1093/imaman/15.3.195⟩

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-00465145

DOI: 10.1093/imaman/15.3.195

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().