arXiv (All)
open access
Better Late Than Never: Online Flow Time Scheduling with Online Estimates
In the classical online flow-time scheduling problem on a single machine, jobs arrive over time and must be processed to minimize the total time they spend in the system: for over fifty years, we have known that SRPT is an optimal online algorithm. But this algorithm requires exactness in two differ
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
- For which problems in P is it easier to verify the result than to find it?#787574
- Confidence Horizons#1076117
- The Retreating Flag: What Time-Sharing Does to Peterson’s Algorithm, and a Lab That Shows It#1180062
- Leveraging I/O Stalls for Efficient Scheduling in ANNS#204867
- Can AI Scientists Coordinate at Runtime?#1155915
Record · ID 984328
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