HAL (France)
open access
Robust scheduling with stochastic processing times in flexible job-shops
This thesis focuses on incorporating variability, specifically stochastic processing times, in the flexible job-shop scheduling problem. A metric called service level on the makespan (the date when all operations are completed) is used and motivated to evaluate the robustness of a schedule. This ser
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
- Integration of transportation constraints in the flexible job-shop scheduling problem#922894
- Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs#274657
- Dynamic job-shop scheduling using reinforcement learning agents#204550
- A Parametrized Complexity View on Robust Scheduling with Budgeted Uncertainty#793567
- A Parametrized Complexity View on Robust Scheduling with Budgeted Uncertainty#789563
Record · ID 1166361
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