arXiv (All)
open access
On Randomized Online Span Minimization
We study the online Busy Time scheduling model on a single machine of unbounded capacity, with non-preemptive jobs. In our setting, flexible jobs arrive online with a processing time and deadline, both of which become known to the algorithm at the job's arrival time. The goal is to schedule jobs on
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
- Generalizing Beyond Suboptimality: Offline Reinforcement Learning Learns Effective Scheduling through Random Solutions#1035314
- Online Flexible Busy Time Scheduling on Heterogeneous Machines#1034632
- Ensuring Data Freshness in Multi-Rate Task Chains Scheduling#2727
- Agentic CPU-GPU Scheduling for Heterogeneous AI Workloads#405626
- FlashDiff: Efficient Regional Execution and Scheduling for Diffusion Model Serving#366231
Record · ID 973302
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