arXiv (All)
open access
Robust Non-Clairvoyant Scheduling with Classification Models
We study the classical single-machine scheduling problem of minimizing the sum of completion times of jobs in a non-clairvoyant setting, where the processing time of each job remains unknown until its completion. This is a hard problem for which no constant competitive algorithm is possible. Inspire
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
- Machine Learning Applications for Production Scheduling Optimization#81203
- Integrating Production and Maintenance Scheduling Under Stochastic Production Conditions#371039
- Lifelong Machine Learning#10836
- Taming Request Imbalance: SLO-Aware Scheduling for Disaggregated LLM Inference#155240
- Time series one class classification: a systematic review of methods, applications, and challenges#1002130
Record · ID 1156615
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