arXiv (All)
open access
Tight Bounds for Paging with Time Windows and Joint Replenishment with Varying Opening Costs
We study the paging with time windows problem, a natural generalization of classical paging, in which each request must be served within a specified time interval. This model allows the algorithm to delay service and batch service requests over time, but also introduces significant challenges due to
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling#423922
- A bin packing formulation for the joint batching, routing and sequencing problem#1014444
- The Merit of Simple Policies: Buying Performance With Parallelism and System Architecture#163108
- Dynamic priority rules for cyclic queues with limited service regime#239228
- The 11/6 supremum of the Wang-Sitters rounding scheme for graph balancing#998384
Record · ID 1423222
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive