Designing Service Level Agreements for Inventory Management
Bibliographic record
Abstract
Service level agreements (SLAs) are widely employed forms of performance‐based contracts in operations management. They compare performance during a period against a contracted service level and penalize outcomes exceeding some allowed deviation. SLAs have a number of design characteristics that need careful tuning to ensure that incentives are properly aligned. However, there is little theoretical research in this area. Using an example of an SLA for outsourcing inventory management, we make a number of recommendations. First it is preferable, if possible, that penalties be proportional to the underperformance rather than lump‐sum ones. This goes a long way towards mitigating strategic (“gaming”) behavior by the supplier. Second, it might be thought that giving “bonuses for good performance” rather than “penalties for bad performance” are essentially identical apart from the former being a more positive approach to management. This turns out to be incorrect in the case of large percentage service rate targets and that penalties will normally be preferred by the buying firm. Third, in order not to incorrectly penalize underperformance resulting purely from “noise” rather than supplier efforts, management might think it best to make allowed deviations from the target generous. Again intuition is not a helpful guide here: for proportional penalties, acceptable performance deviations should be close to the target. Although these results come from a particular inventory application, it is likely that the lessons are applicable to SLAs in general.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.016 | 0.023 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.002 | 0.003 |
| Scholarly communication | 0.006 | 0.009 |
| Open science | 0.002 | 0.005 |
| Research integrity | 0.003 | 0.004 |
| Insufficient payload (model declined to judge) | 0.009 | 0.003 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".