Allocation of jobs and identical resources with two pooling centers

Hui-Chih Hung, Marc E. Posner*

*Corresponding author for this work

Research output: Contribution to journalArticle

3 Scopus citations


We examine the resource allocation problem of partitioning identical servers into two parallel pooling centers, and simultaneously assigning job types to pooling centers. Each job type has a distinct Poisson arrival rate and a distinct holding cost per unit time. Each pooling center becomes a queueing system with an exponential service time distribution. The goal is to minimize the total holding cost. The problem is shown to be polynomial if a job type can be divided between the pooling centers, and NP-hard if dividing job types is not possible. When there are two servers and jobs cannot be divided, we demonstrate that the two pooling center configuration is rarely optimal. A heuristic which checks the single pooling center has an upper bound on the relative error of 4/3. The heuristic is extended for the multiple server problem, where relative error is bounded above by the number of servers.

Original languageEnglish
Pages (from-to)179-194
Number of pages16
JournalQueueing Systems
Issue number3
StatePublished - 1 Mar 2007


  • Parallel queueing system
  • Resources allocation
  • Work-in-process cost
  • Workload allocation problem

Fingerprint Dive into the research topics of 'Allocation of jobs and identical resources with two pooling centers'. Together they form a unique fingerprint.

  • Cite this