This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by van der Laan, D. Search for Related Content

Routing Jobs to Servers with Deterministic Service Times

Department of Econometrics and Operations Research, Vrije Universiteit, De Boelelaan 1105, 1081 HV Amsterdam, The Netherlands
dalaan{at}feweb.vu.nl

In this paper we consider the problem of routing deterministic arriving jobs to parallel servers with deterministic (distinct) service times, where we assume that the arrival rate of the jobs is equal to the total service capacity of the servers. Our goal is to find routing policies that minimize the long-run average waiting time of the arriving jobs. We give lower and upper bounds for the minimal long-run average waiting time, and we present results on the structure of optimal policies. We derive mathematical programming problems that can be solved to obtain optimal routing policies, and for a single queue we have results on routing according to a regular sequence to that queue. Finally, we discuss several algorithms to obtain within reasonable time good but generally not optimal deterministic routing policies.

Key Words: parallel deterministic servers; deterministic routing policies; regular sequences
History: Received: July 20, 2000; revision received: August 17, 2004;

This article has been cited by other articles:

				A. Hordijk and D. van der Laan On the Average Waiting Time for Regular Routing to Deterministic Queues Mathematics of Operations Research, May 1, 2005; 30(2): 521 - 544. [Abstract] [PDF]