arXiv (All)
open access
Near-Optimal Consistency-Robustness Bounds for Non-Clairvoyant Scheduling
We study the problem of characterizing the optimal consistency--robustness tradeoff for single-machine non-clairvoyant scheduling with predicted processing times. For a fixed number of jobs $n$, Wei and Zhang (2020) established a lower bound on the achievable consistency--robustness tradeoff which i
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
- Robust Non-Clairvoyant Scheduling with Classification Models#1156615
- Machine Learning Applications for Production Scheduling Optimization#81203
- Operational Reliability of Deadline-Constrained Task Assignment: Stability Characterization and Adversarial Routing#670422
- Operational Reliability of Deadline-Constrained Task Assignment: Stability Characterization and Adversarial Routing#668357
- Note on “Single-machine and flowshop scheduling with a general learning effect model” and “Some single-machine and m-machine flowshop scheduling problems with learning considerations”#490996
Record · ID 1413278
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