Getting it into your agent
One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.
npx skills add hajibabaie/combinatorial-optimization-skills --skill flow-shop-schedulinggit clone --depth 1 https://github.com/hajibabaie/combinatorial-optimization-skillsWrote this? Show the measurements
A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.
[](https://agentmods.dev/skills/hajibabaie/combinatorial-optimization-skills/flow-shop-scheduling)<a href="https://agentmods.dev/skills/hajibabaie/combinatorial-optimization-skills/flow-shop-scheduling"><img src="https://agentmods.dev/badge/skills/hajibabaie/combinatorial-optimization-skills/flow-shop-scheduling/github.svg" alt="Measured on agentmods" height="20"></a>Or the 80×15 button, for a site that already has a row of RSS and ATOM ones. Only the verdict fits; the numbers stay here.
<a href="https://agentmods.dev/skills/hajibabaie/combinatorial-optimization-skills/flow-shop-scheduling"><img src="https://agentmods.dev/badge/skills/hajibabaie/combinatorial-optimization-skills/flow-shop-scheduling.svg" alt="Reviewed on agentmods" width="80" height="20"></a>What it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5.1 | $0.00139 | $0.10856 |
| Opus 5 | $0.00069 | $0.05428 |
| Sonnet 5 | $0.00028 | $0.02171 |
| Haiku 4.5 | $0.00014 | $0.01086 |
Grade A, and why
flow-shop-scheduling scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 10d ago.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
How it starts
The opening of the file, as written. The whole thing — 781 lines — stays where its author put it; the contents beside it link to each section on GitHub.
Flow-Shop Scheduling
You are an expert in flow-shop scheduling. This skill covers the permutation flow-shop problem (PFSP): fast makespan evaluation, the NEH construction heuristic, exact MIP formulations, iterated greedy (IG) as the state-of-the-art heuristic, Taillard-style benchmark instances, and the multi-objective extension with makespan plus total tardiness. Use the framework below to match the formulation and solution method to instance size, objective, and time budget.
Initial Assessment
Establish the following before writing any model or code:
- Instance size. Number of jobs
nand machinesm. Taillard sizes run from 20x5 to 500x20. Exact methods prove optimality only for roughlyn <= 15; everything larger is heuristic territory. - Routing structure. Confirm every job visits machines
1..min the same order. If jobs have job-specific routes, this is a job shop — switch to job-shop-scheduling. - Permutation assumption. Is the same job order required on all machines? Standard PFSP assumes
yes. For
m >= 4, the best non-permutation schedule can beat the best permutation schedule; confirm the user accepts the (almost universal) permutation restriction. - Buffer behavior. Unlimited intermediate buffers (standard), no buffers (blocking), or no waiting allowed between machines (no-wait)? Each changes the makespan recursion.
- Setup times. Sequence-dependent setup times (SDST) change both the MIP and the acceleration data structures; ask explicitly.
- Objective. Makespan
C_max, total flowtime, total (weighted) tardiness, or several at once? Tardiness needs due dates — ask how they are generated or provided. - Exact vs heuristic need. Is a provable optimum required, or is "within 1% of best known in 30 seconds" acceptable? This decides MIP vs NEH/IG immediately.
- Time budget. Per-instance wall-clock limit. The standard PFSP stopping convention is
t = n * (m / 2) * 60milliseconds (Ruiz & Stuetzle 2007); confirm what comparison protocol applies. - Solver availability. Gurobi license present? If not, the MIP parts map to HiGHS/CBC via the same model structure, or skip exact methods entirely.
- Data format. Matrix of processing times
p[i][j](machine-major) or job-major? Taillard files list processing times machine by machine; off-by-one transposition is the most common data bug. - Benchmark expectations. Will results be compared against Taillard or VRF best-known values? Then fix seeds, report relative percentage deviation (RPD), and pin the reference-value snapshot.
- Reproducibility. Seeds for instance generation and for every metaheuristic run; one result row per (instance, algorithm, seed).
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- 10d ago First seen · 781 lines · 139 tokens per session scan A 4629d0e47761
flow-shop-scheduling is a skill published in the GitHub repository hajibabaie/combinatorial-optimization-skills (7 stars, last pushed 2mo ago), licensed MIT. It adds 139 tokens to every session and 10,856 once invoked, about $0.0007 per session on Opus 5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-31.
Other skills, from other repositories
learn-from-fix
Capture Elixir/Ecto/LiveView lessons and Hex API rules. Use after corrections or when asked to document learning, record a lesson, prevent a fixed mistake, or remember package guidance with --library.
phx-deps-audit
Audit Hex deps for supply-chain security risk — bidi chars, compile-time exec, maintainer changes, typosquats, CVEs. Use after mix deps.update, when checking if a package upgrade is safe, or reviewing mix.lock PR diffs.
promote
Generate X/Twitter release promotion posts with ASCII tables and CodeSnap rendering. Use when writing release posts, promotion tweets, plugin announcements, or preparing social media content for new versions.
release
CONTRIBUTOR TOOL - Cut a plugin release: bump plugin.json version, finalize CHANGELOG, update README if needed, gate on make ci, commit, tag vX.Y.Z, and create the GitHub release. Use when shipping a new plugin version. NOT distributed.
session-deep-dive
Deep qualitative analysis of high-signal sessions. Spawns subagents with v2 template, synthesizes patterns, compares against known findings. Use after /session-scan.
catchup
Summarize and review what changed while you were away. Use after a weekend, vacation, or flight to check missed PRs, git commits, Linear tickets, and meetings — one prioritized brief, not a firehose.