A.2.2:6.2 - Software Service as Deployed System

PlannerService_v4 is a deployed System. In this constructed example, its claimed ability is to return feasible job-shop schedules for 50–500 jobs and 5–40 machines in less than 20 ms in PlantScheduling_2026, with makespan at most 1.05 × L_ref. Makespan is the elapsed time from the common start to the last job completion; L_ref > 0 is the makespan of the declared feasible reference schedule for the same instance. With L_ref = 100 min, 104 min passes this quality bound and 106 min fails. The reference is a comparison baseline, not a proved optimum.

The deployed System is the holder; the algorithm paper and MethodDescription are descriptions. Version, dependencies and input range qualify the ability claim. Measurements can support that claim, and their age can limit current reliance without itself changing the System’s ability.