arXiv (All)
open access
Minimizing the makespan in job shop scheduling under conflict graph constraints
We study the job shop scheduling problem with a conflict graph (JSC), in which adjacent jobs in the conflict graph cannot be processed simultaneously on different machines, with the objective of minimizing the makespan. The problem models settings where jobs share additional resources while retainin
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
- Consistency-Robustness Tradeoffs for Strategyproof Scheduling with Predictions#1083562
- Partially Stateful Server Selection for Minimal Age of Information Scheduling Over a Finite Horizon#614588
- A Production Scheduling Framework for Reinforcement Learning Under Real-World Constraints#1104861
- Single-Machine Scheduling with Interval Predictions and Costly Preemption#1109494
- TRACE: Tackling Real-World Resource Assignment Problems via Agentic Heuristic Design#1157158
Record · ID 927027
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