Job Shop Scheduling

When the user wants to model and solve job-shop scheduling problems, sequencing job operations on machines under fixed per-job routes, minimizing makespan or tardiness, via disjunctive MIP, CP-SAT interval models, or critical-path tabu search. Also use when the user mentions "job shop," "disjunctive constraints," "makespan," "operations sequencing," "critical path neighborhood," "shifting bottleneck," or when every job visits machines in its own technological order. For permutation flow shops, see flow-shop-scheduling; for deeper CP-SAT modeling, see constraint-programming.

hajibabaie Updated 18 repo stars

File contents

hajibabaie/combinatorial-optimization-skills commit f1e8851066

Frequently asked questions

npx get-skill add hajibabaie/job-shop-scheduling