2013
DOI: 10.3138/infor.51.4.215
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Routing of Fixed Size Jobs to Two Parallel Servers

Abstract: We consider a heterogeneous two-server system processing fixed size jobs. This includes the scheduling system, where jobs wait in a common queue, and the dispatching system, where jobs are assigned to server-specific queues upon arrival. The optimal policy with respect to the delay in both systems is a threshold policy characterized by a single parameter. In this special case, the scheduling and dispatching systems achieve the same performance with the optimal threshold. The optimal threshold depends on the ar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
9
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(9 citation statements)
references
References 31 publications
0
9
0
Order By: Relevance
“…The problem of finding optimal allocation policy in a heterogeneous two-server system processing fixed size jobs, which is the subject of this paper, has already been considered before and the apparently latest results appear in [11]. In [11] the flow of jobs is Poisson and jobs are served in FCFS manner from queues. The objective is minimization of mean sojourn time in the system.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…The problem of finding optimal allocation policy in a heterogeneous two-server system processing fixed size jobs, which is the subject of this paper, has already been considered before and the apparently latest results appear in [11]. In [11] the flow of jobs is Poisson and jobs are served in FCFS manner from queues. The objective is minimization of mean sojourn time in the system.…”
Section: Introductionmentioning
confidence: 99%
“…The objective is minimization of mean sojourn time in the system. Authors show that this problem is related to the well-known slow-serverproblem ( [11], [12]). From this observation they derive the following result: optimal allocation policy is of threshold type with one threshold i.e.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…For clarity, we have omitted LWL, whose switch-over curve is simply y = x. For reference, we have also included the switch-over curve of the optimal dispatching policy when the objective is to minimize the mean latency [17]. We can see that both FPI and Dead-1 ''protect'' the faster Server 1 from overload.…”
Section: S)mentioning
confidence: 99%
“…c This value is calculated as the product (mean total service time of all jobs in a cluster of the same type as the incoming one)× (threshold value). This is the analogue of the threshold policy used, for example, in Hyytia (2013).…”
mentioning
confidence: 99%