Mathematical Methods of Operations Research

, Volume 48, Issue 3, pp 337–347

Optimal scheduling in heterogeneous two-station queueing networks

  • Nicole Bäuerle
  • Gabi Brüstl
  • Ulrich Rieder

DOI: 10.1007/s001860050031

Cite this article as:
Bäuerle, N., Brüstl, G. & Rieder, U. Mathematical Methods of OR (1998) 48: 337. doi:10.1007/s001860050031
  • 39 Downloads

Abstract.

We consider a two-station network with two types of jobs: type 0 jobs require service at station 1 only and type 1 jobs require service both at station 1 and 2 in sequence. Each station has a single server. The problem is to schedule the server at station 1 between the two types of jobs in order to minimize the linear holding cost of the system. We will treat the discounted as well as the average cost criterion. In both cases we can prove that the optimal policy is a switching-curve policy. A numerical sensitivity analysis is also presented.

Key words: Multiclass queueing networks dynamic scheduling stochastic control switching-curve policy 

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Nicole Bäuerle
    • 1
  • Gabi Brüstl
    • 1
  • Ulrich Rieder
    • 1
  1. 1.Department of Mathematics VII, University of Ulm, D-89069 Ulm, Germany (e-mail: baeuerle@mathematik.uni-ulm.de)DE