Authored Job-shop Order Schedule

How to use Authored Job-shop Order Schedule

Name each operation, its machine and positive duration. Declare each job route and each complete machine order; inspect precedence witnesses, earliest starts, a critical path and a concrete cycle when the choices conflict.

1. Use the example as the schema; replace its labels and entered model assumptions.
2. Name each operation, its machine and positive duration. Declare each job route and each complete machine order; inspect precedence witnesses, earliest starts, a critical path and a concrete cycle when the choices conflict.
3. Calculate, inspect the complete witnesses and limitations, then copy or download the JSON report.

Good to know

• 1–20 machines, 1–20 jobs and 1–100 operations total. Every operation uses one known machine and a positive exact decimal duration up to 1,000,000,000 with six places. Include unused machines with an empty order; include every assigned operation exactly once.
• All operations are available through their predecessors from time zero, with one consistent time unit. Strictly positive durations make any directed precedence cycle infeasible. Source order resolves equal-path display choices.
• A fixed-order feasibility and earliest-time calculation, not a search over job-shop permutations. No setup, transport, downtime, release/due dates, alternate machines, preemption or guaranteed globally shortest makespan.
• Local calculation with no upload, input persistence or outside lookup. Model JSON is limited to 30,000 characters and 10,000 values. Decimal quantities are strings with up to six places; count fields use plain JSON integers. Exact fractions are capped at 8,192 bits. The complete JSON output is limited to 1,000,000 characters; approximate numbers preserve their stored values. Unsupported states fail explicitly.