A c/μ‐Rule for Job Assignment in Heterogeneous Group‐Server Queues

Volume: 31, Issue: 3, Pages: 1191 - 1215
Published: Dec 4, 2021
Abstract
We study a dynamic job assignment problem in queueing systems with one class of Poisson arrivals and K groups of heterogeneous servers. A scheduling policy prescribes the job assignment among servers in each group at every state n (number of jobs in the system). Our goal is to obtain the optimal policy to minimize the long-run average cost, which involves the increasingly convex holding cost for jobs and the operating cost for working servers....
Paper Details
Title
A c/μ‐Rule for Job Assignment in Heterogeneous Group‐Server Queues
Published Date
Dec 4, 2021
Volume
31
Issue
3
Pages
1191 - 1215
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.