HAL (France)
open access
Mathematical Model and Evaluation Function for Conflict-Free Warranted Makespan Minimization of Mixed Blocking Constraint Job-Shop Problems
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
- Preconditioned Three-Term Conjugate Gradient Framework for Nonconvex Finite Minimax Problems#1083257
- Screen Before You Fetch: Compressed Byzantine Screening for Decentralized Learning on the Edge-Cloud Continuum#1117258
- GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity#441756
- Edge-coloring problems with forbidden patterns and planted colors#177099
- Fast Solution Methods for the Classical 0–1 Knapsack Problem#731698
Record · ID 257765
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