A Newsvendor Approach to Design of Surgical Preference Cards
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
Surgical procedures require a large number of consumable supplies that need to be kept in hospital inventory and transported to the operating rooms (OR) before the surgery. A surgical preference card (SPC) provides a list of items to be prepared for each surgery. For each item, a SPC also specifies how many should be taken to the OR (fill quantity). As the usage of most consumables in the OR is subject to uncertainty, the cards also specify how many of the filled items should be opened at the beginning of the surgery (open quantity). The fill and open quantities control the flow of consumables between the hospital inventory and the ORs and directly affect the wastage in ORs. In this work, we formulate the problem of determining the fill and open quantities on the preference cards as a stochastic optimization problem, where the objective is to minimize a weighted sum of the expected wastage and operational costs. We show that, as in the newsvendor problem, the optimal solution for the fill and open quantities takes the form of critical quantiles of the item usage distribution in the OR. The solution form together with historical usage data provide a data-driven approach to design of SPCs, as well as insights on the value of including an open decision. We demonstrate our approach using extensive numerical experiments and real usage data from a Canadian hospital. The results suggest a potential for significant reduction of wastage and operational costs in the ORs.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.003 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| 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