Robust design of service systems with immobile servers, general arrival and service patterns, and demand uncertainty
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
This paper addresses the problem of robustly designing a service system consisting of immobile servers, each modelled as a G/G/1 queuing system, when the arrival rates are not known with certainty. The problem involves locating service centers, determining their capacities and assigning customers to them to minimize the total cost, which includes the setup, access and waiting costs. Besides the nominal problem, two robust problems with budget and ball uncertainty sets are considered. A piecewise-linear approximation is applied to handle the nonlinear waiting cost, which enables all the problems to be tightly approximated as mixed-integer quadratic programs. We also propose a Lagrangian approach that is capable of finding high-quality solutions and strong bounds for instances of practical sizes. Numerical experiments were conducted to validate the proposed models and solution methods and to study the effect of the problem parameters, the uncertainty set size and the objective function approximations on the optimal solution.
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.004 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 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