A <i>c</i> / <i>μ</i> ‐Rule for Job Assignment in Heterogeneous Group‐Server Queues
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
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. This problem has wide application scenarios in operations management, such as job scheduling in manufacturing systems, packet routing in communication systems, and staffing in service systems. We prove that the optimal policy has monotone structures and quasi bang–bang control forms. Specifically, we discover that the optimal policy is governed by the marginal cost rate c − μG ( n ), where c is the operating cost rate, μ is the service rate, and G ( n ) is called the perturbation realization factor at state n . Under the condition of scale economies which can be guaranteed by any increasingly concave operating cost in μ , we prove that the optimal policy obeys a so‐called c / μ ‐ rule : Servers with a smaller c / μ should be occupied by jobs with higher priority. Optimality of multi‐threshold type policies is further proved when the c / μ ‐rule is applied. Our c / μ ‐rule in group‐server queues can be viewed as a counterpart of the famous cμ ‐rule in polling queues, which both significantly reduce the complexity of optimization problems. By utilizing these optimality structures, we also develop computational‐efficient algorithms to determine the optimal policy numerically. Simulation experiments demonstrate the good scalability and robustness of the c / μ ‐rule, which are important for managerial practice.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it