Skip to content

fix(vibe): g63-search-13 — CSP-2-Consistency (verdict contraire, surgénéralisation) + newlines grain #17067

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
jsboige wants to merge 2 commits into from
Closed

fix(vibe): g63-search-13 — CSP-2-Consistency (verdict contraire, surgénéralisation) + newlines grain #17067

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
e29604f
feat(search,#13410): releve densite pedagogique au-dessus de 1200 c/cell
jsboige Sep 20, 2026
7d71acb
fix(vibe): g63-search-13 — CSP-2-Consistency (verdict contraire + sur…
jsboige Sep 20, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 17 additions & 1 deletion MyIA.AI.Notebooks/Search/Applications/CSP/App-4b-JobShopScheduling-CSharp.ipynb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -577,6 +577,14 @@
"$\"Meilleure heuristique : {rules[Array.IndexOf(mk, minMk)]} (makespan={minMk})\".Display();\n"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"**Lecture** : Le tableau montre que les règles MOR et MWKR obtiennent le meilleur makespan de 11 sur l'instance ft03, ",
"démontrant leur supériorité pour ce problème particulier par rapport à SPT (19), LPT (14) et FIFO (14)."
]
},
{
"cell_type": "markdown",
"id": "fabad2d2",
Expand Down Expand Up @@ -714,6 +722,14 @@
"$\"Optimum prouve : makespan = {bestMakespan} | noeuds explores = {nodes} | branches elaguees = {pruned}\".Display();\n"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"**Lecture** : La solution optimale a un makespan de 11, trouvée après l'exploration de 1371 nœuds avec 592 branches élaguées, ",
"illustrant l'efficacité du branch-and-bound pour ce problème de taille modérée."
]
},
{
"cell_type": "markdown",
"id": "a5182c97",
Expand Down Expand Up @@ -1343,4 +1359,4 @@
},
"nbformat": 4,
"nbformat_minor": 5
}
}
Loading
Loading