arXiv (All)
open access
Robust Parallel Machine Scheduling: A Comparison of Robustness Measures and Local Search Approaches
In many real-world scheduling problems, the processing times of tasks are subject to uncertainty. This makes it essential to design schedules that are robust against disruptions. We distinguish between two types of robustness: quality-robust schedules keep a stable objective value under disruptions,
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
- Robustness Analysis of Agentic AI to Inconsistent and Incomplete Tool Responses#793895
- Robustness Analysis of Agentic AI to Inconsistent and Incomplete Tool Responses#789876
- Consistency-Robustness Tradeoffs for Strategyproof Scheduling with Predictions#1083562
- TFR-GNN: Topology- and Fault-Aware Graph Neural Scheduling for Heterogeneous Distributed Computing Systems#986938
- Automatic verification of tasks schedulers#652734
Record · ID 1357071
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