Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-24T01:49:56.417Z Has data issue: false hasContentIssue false
  • English
  • Français

On Suboptimal Policies in Multiclass Tandem Models

Published online by Cambridge University Press:  27 July 2009

Arie Hordijk  and
Ger Koole
Arie Hordijk
Affiliation:
Department of Mathematics and Computer Science, Leiden University, P.O. Box 9512, 2300 RA Leiden, The Netherlands
Ger Koole
Affiliation:
INRIA Sophia Antipolis, B.P. 93, 06902 Sophia Antipolis Cedex, France
Get access Rights & Permissions [Opens in a new window]

Abstract

We study two single-server multiclass systems in tandem. As simple optimal policies exist only in special cases, our objective is to study simple policies that perform close to optimality. For one such policy, which is based on the μc rule, we prove that it is optimal in an asymptotic sense. Numerical work comparing this policy with the optimal one is also supplied.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 10 , Issue 1 , January 1996 , pp. 29 - 39
Copyright
Copyright © Cambridge University Press 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Asmussen, S. & Koole, C.M. (1993). Marked point processes as limits of Markovian arrival streams. Journal of Applied Probability 30: 365–372.CrossRefGoogle Scholar
2.Hordijk, A. & Koole, G.M. (1993). On the optimality of LEPT and μc rules for parallel processors and dependent arrival processes. Advances in Applied Probability 25: 979–996.CrossRefGoogle Scholar
3.Koole, G.M. (1994). Assigning a single server to inhomogeneous queues with switching costs. Technical Report BS-R9405, CWI, Amsterdam.Google Scholar
4.Righter, R. (1994). Scheduling. In Shaked, M. & Shanthikumar, J.G. (eds.), Stochastic orders and their applications. New York: Academic Press, pp. 381–432.Google Scholar
5.van Dijk, N.M. (1988). On the finite horizon Bellman equation for controlled Markov jump models with unbounded characteristics: Existence and approximations. Stochastic Processes and Their Applications 28: 141–157.CrossRefGoogle Scholar
6.Weiss, G. (1990). Approximation results in parallel machines stochastic scheduling. Annals of Operations Research 26: 195–242.CrossRefGoogle Scholar