Analysis of job assignment with batch arrivals among heterogeneous servers

Zhongju Zhang, John Daigle

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

We revisit the problem of job assignment to multiple heterogeneous servers in parallel. The system under consideration, however, has a few unique features. Specifically, repair jobs arrive to the queueing system in batches according to a Poisson process. In addition, servers are heterogeneous and the service time distributions of the individual servers are general. The objective is to optimally assign each job within a batch arrival to minimize the long-run average number of jobs in the entire system. We focus on the class of static assignment policies where jobs are routed to servers upon arrival according to pre-determined probabilities. We solve the model analytically and derive the structural properties of the optimal static assignment. We show that when the traffic is below a certain threshold, it is better to not assign any jobs to slower servers. As traffic increases (either due to an increase in job arrival rate or batch size), more slower servers will be utilized. We give an explicit formula for computing the threshold. Finally we compare and evaluate the performance of the static assignment policy to two dynamic policies, specifically the shortest expected completion policy and the shortest queue policy.

Original languageEnglish (US)
Pages (from-to)149-161
Number of pages13
JournalEuropean Journal of Operational Research
Volume217
Issue number1
DOIs
StatePublished - Feb 16 2012
Externally publishedYes

Fingerprint

Batch Arrivals
Assignment
Servers
Server
Batch
Assign
Traffic
Queueing System
Long-run
Poisson process
Structural Properties
Repair
Queue
Completion
Job assignment
Structural properties
Explicit Formula
Policy
Entire
Minimise

Keywords

  • Batch arrival
  • Job assignment
  • Parallel queues
  • Threshold policy

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Modeling and Simulation
  • Information Systems and Management

Cite this

Analysis of job assignment with batch arrivals among heterogeneous servers. / Zhang, Zhongju; Daigle, John.

In: European Journal of Operational Research, Vol. 217, No. 1, 16.02.2012, p. 149-161.

Research output: Contribution to journalArticle

@article{0ec4f17b69d14b6793195159c96ba7f1,
title = "Analysis of job assignment with batch arrivals among heterogeneous servers",
abstract = "We revisit the problem of job assignment to multiple heterogeneous servers in parallel. The system under consideration, however, has a few unique features. Specifically, repair jobs arrive to the queueing system in batches according to a Poisson process. In addition, servers are heterogeneous and the service time distributions of the individual servers are general. The objective is to optimally assign each job within a batch arrival to minimize the long-run average number of jobs in the entire system. We focus on the class of static assignment policies where jobs are routed to servers upon arrival according to pre-determined probabilities. We solve the model analytically and derive the structural properties of the optimal static assignment. We show that when the traffic is below a certain threshold, it is better to not assign any jobs to slower servers. As traffic increases (either due to an increase in job arrival rate or batch size), more slower servers will be utilized. We give an explicit formula for computing the threshold. Finally we compare and evaluate the performance of the static assignment policy to two dynamic policies, specifically the shortest expected completion policy and the shortest queue policy.",
keywords = "Batch arrival, Job assignment, Parallel queues, Threshold policy",
author = "Zhongju Zhang and John Daigle",
year = "2012",
month = "2",
day = "16",
doi = "10.1016/j.ejor.2011.09.001",
language = "English (US)",
volume = "217",
pages = "149--161",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Analysis of job assignment with batch arrivals among heterogeneous servers

AU - Zhang, Zhongju

AU - Daigle, John

PY - 2012/2/16

Y1 - 2012/2/16

N2 - We revisit the problem of job assignment to multiple heterogeneous servers in parallel. The system under consideration, however, has a few unique features. Specifically, repair jobs arrive to the queueing system in batches according to a Poisson process. In addition, servers are heterogeneous and the service time distributions of the individual servers are general. The objective is to optimally assign each job within a batch arrival to minimize the long-run average number of jobs in the entire system. We focus on the class of static assignment policies where jobs are routed to servers upon arrival according to pre-determined probabilities. We solve the model analytically and derive the structural properties of the optimal static assignment. We show that when the traffic is below a certain threshold, it is better to not assign any jobs to slower servers. As traffic increases (either due to an increase in job arrival rate or batch size), more slower servers will be utilized. We give an explicit formula for computing the threshold. Finally we compare and evaluate the performance of the static assignment policy to two dynamic policies, specifically the shortest expected completion policy and the shortest queue policy.

AB - We revisit the problem of job assignment to multiple heterogeneous servers in parallel. The system under consideration, however, has a few unique features. Specifically, repair jobs arrive to the queueing system in batches according to a Poisson process. In addition, servers are heterogeneous and the service time distributions of the individual servers are general. The objective is to optimally assign each job within a batch arrival to minimize the long-run average number of jobs in the entire system. We focus on the class of static assignment policies where jobs are routed to servers upon arrival according to pre-determined probabilities. We solve the model analytically and derive the structural properties of the optimal static assignment. We show that when the traffic is below a certain threshold, it is better to not assign any jobs to slower servers. As traffic increases (either due to an increase in job arrival rate or batch size), more slower servers will be utilized. We give an explicit formula for computing the threshold. Finally we compare and evaluate the performance of the static assignment policy to two dynamic policies, specifically the shortest expected completion policy and the shortest queue policy.

KW - Batch arrival

KW - Job assignment

KW - Parallel queues

KW - Threshold policy

UR - http://www.scopus.com/inward/record.url?scp=80054963665&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80054963665&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2011.09.001

DO - 10.1016/j.ejor.2011.09.001

M3 - Article

VL - 217

SP - 149

EP - 161

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -