Routing jobs with deadlines to heterogeneous parallel servers
type: Item
instance of: scholarly article
title: Routing jobs with deadlines to heterogeneous parallel servers
zbMATH Open document ID: 1380.90117
author: Esa Hyytiä
author: Rhonda Righter
published in: Operations Research Letters
publication date: 2018-02-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6835051
zbMATH Keywords: job dispatching
zbMATH Keywords: deadline
zbMATH Keywords: QoE
zbMATH Keywords: parallel processing
zbMATH Keywords: SLA
zbMATH Keywords: heavy-traffic approximation
MaRDI profile type: Publication
full work available at URL: j.orl.2016.05.009
OpenAlex ID: W2418456802
cites work: On the value function of the M/Cox(r)/1 queue
cites work: Certain optimality properties of the first-come first-served discipline for G/G/s queues
cites work: A simple dynamic routing problem
cites work: TWO QUEUES IN PARALLEL
cites work: Introduction to Queueing
cites work: Size- and state-aware dispatching problem with queue-specific job sizes
cites work: Optimal load balancing on distributed homogeneous unreliable processors
cites work: Q4339077
cites work: Optimality of the shortest line discipline
DOI: 10.1016/J.ORL.2016.05.009
description: scientific article; zbMATH DE number 6835051