Skip to main content
SpringerLink
Log in

A scheduling problem for several parallel servers

  • Original Article
  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

In this paper, we study a scheduling problem of jobs from two different queues on several parallel servers. Jobs have exponentially distributed processing times, and incur costs per unit of time, until they leave the system, and there are no arrivals to the system at any time. The objective is to find the optimal strategy, i.e., to allocate the servers to the queues, such that the expected holding costs are minimized. We give a sufficient condition for which it is always optimal to allocate the servers only to jobs of a certain queue. Finally, the case of two servers is completely solved.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Chang CS, Nelson R, Pinedo M (1991) Scheduling two classes of exponential jobs on parallel processors: structural results and worst-case analysis. Adv Appl Probab 23:925–944

    Article  MATH  MathSciNet  Google Scholar 

  • Chang CS, Chao X, Pinedo M, Weber R (1992) On the optimality of LEPT and c μ rules for machines in parallel. J Appl Probab 29(3):667–681

    Article  MATH  MathSciNet  Google Scholar 

  • Kämpke T (1989) Optimal scheduling of jobs with exponential service times on identical parallel processors. Oper Res 37(1):126–133

    Article  MATH  MathSciNet  Google Scholar 

  • Ross S (1983) Introduction to stochastic dynamic programming. Academic, New York

    MATH  Google Scholar 

  • Schiefermayr K, Weichbold J (2005) A complete solution for the optimal stochastic scheduling of a two-stage tandem queue with two flexible servers. J Appl Probab 42(3):778–796

    Article  MATH  MathSciNet  Google Scholar 

  • Schiefermayr K, Weichbold J (2006) The optimal control of a general tandem queue. Prob Eng Inf Sci 20:307–327

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik, Fachhochschule Wels, Stelzhamerstrasse 23, 4600, Wels, Austria

    Klaus Schiefermayr

  2. Institut für Stochastik, Universtität Linz, Altenbergerstrasse 69, 4040, Linz, Austria

    Josef Weichbold

Authors
  1. Klaus Schiefermayr
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Josef Weichbold
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Josef Weichbold.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schiefermayr, K., Weichbold, J. A scheduling problem for several parallel servers. Math Meth Oper Res 66, 127–148 (2007). https://doi.org/10.1007/s00186-007-0150-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00186-007-0150-4

Keywords

Search

Navigation