arXiv (OAI Expanded)
open access
A Parametrized Complexity View on Robust Scheduling with Budgeted Uncertainty
In this study, we investigate a robust single-machine scheduling problem under processing time uncertainty. The uncertainty is modeled using the budgeted approach, where each job has a nominal and deviation processing time, and the number of deviations is bounded by Γ. The objective is to minimize t
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
- A Parametrized Complexity View on Robust Scheduling with Budgeted Uncertainty#793567
- Robust scheduling with stochastic processing times in flexible job-shops#1166361
- Adjustable Robust Optimization with Discrete Uncertainty#796345
- On the consideration of uncertainty in design: optimization - reliability - robustness#257777
- Exact Methods for Solving k-Delete Recoverable Robust 0-1 Problems Under Budgeted Uncertainty#1077407
Record · ID 789563
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