{"paper":{"title":"The Value of Temporary Control for the M/M/1 Queue","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Camiel M.P. Koopmans, Floske M. Spieksma, Odysseas Kanavetas","submitted_at":"2026-05-29T17:41:56Z","abstract_excerpt":"In this article, a one-off option for temporary service rate control for the M/M/1 queue is considered.\n  After taking this option, during a single exponentially distributed period, two service rates are available for use. Once service rate control is lost, the system continues with a fixed service rate $\\mu$. The objective is to minimise the sum of holding costs and service costs.\n  We approximate the expected total saved cost by taking the one-off option, depending on the starting state or starting distribution.\n  Using the Value Iteration algorithm with $M$-uniform geometric recurrence, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.31573","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.31573/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}