This note studies a lossless storage system in which every arrival must be served within a fixed number of rounds. The controller acts before seeing the current arrival and cost. Its performance is compared with fixed allocations across service ages.
The manuscript gives a deadline-feasible allocation method and regret bounds. Its storage lower bound allows state marginal costs of either sign. For consumption-only costs, the optimal dependence on the deadline remains open.
This is a research draft. The manuscript states that AI generated the paper from my overarching problem idea; the full disclosure is on its first page.
Open PDFDownload PDFSource and revision history
The PDF below updates automatically when I publish a new PDF in the source repository.
If the preview is unavailable on your device, use the Open PDF or Download PDF link above.