A.3.1:5.2 - Optimization model

Situation and reusable way. JS_Schedule_v4 applies when the jobs, eligible machines, durations, precedence constraints, feasibility rules, and optimization objective are all stated for the scheduling problem. A planner or solver system enacting it constructs candidate assignments, rejects infeasible candidates, compares the remainder by the declared objective, and records the selected schedule or no feasible schedule. Missing precedence data, an unstated objective, or incompatible machine eligibility is a stop rather than permission to guess a method variant.

This identification lets a planner compare two solver packages as descriptions of the same scheduling method. The MILP formulation and solver configuration are U.MethodDescription or formal-substrate candidates according to the claim. The selected production schedule is a U.WorkPlan; the dated solver run is Work; and its decision record is a separate result episteme.