Check a preparation sequence against each job’s deadline

A preparation plan can contain enough total time while still finishing one item too late. Check completion against each item's own deadline before accepting the sequence. The useful record preserves job identities, occupied time, completion points, and missed deadlines instead of reporting only when the whole batch ends.

Fix the work and its boundaries

Fictional practice example: one preparation station handles jobs A and B. A needs four planning turns and must finish by turn seven. B needs two turns and must finish by turn three. Both are ready at turn zero. Each job runs uninterrupted, and the station handles only one job at a time.

These turns are invented units, not estimates of actual team effort. There are no prerequisites, setup costs, breaks, or new arrivals in this exercise. A finish exactly at the deadline counts as on time. Record those assumptions beside the jobs so a later comparison cannot quietly change the available work or boundary rule.

Calculate the proposed order by identity

Suppose the proposed sequence is A then B. A starts at zero and finishes at four. B starts at four and finishes at six. A meets its deadline of seven. B misses its deadline of three by three turns.

Keep a separate completion entry for each job. For this ledger, lateness means the amount by which completion exceeds the deadline, with zero recorded when the job finishes on time. A has zero lateness and B has three. A single statement that the batch takes six turns would hide the failed commitment to B.

Replay the alternative without changing inputs

Now preserve that ledger and examine B then A. B runs from zero to two and meets its deadline of three. A runs from two to six and meets its deadline of seven. Both lateness entries are zero.

The batch still finishes at six. The different result comes from the order, not shorter work, extra capacity, or an earlier overall finish. With only these two jobs, the two sequences exhaust the possible uninterrupted orders. The example therefore supplies a feasible sequence under its exact assumptions; it does not establish a universal scheduling rule for larger or different workloads.

Examine what would invalidate the arrangement

An actual preparation request may have an unavailable input, a required break, or a deadline whose meaning is disputed. Identify those conditions before translating this worksheet into a commitment. A job that cannot start at zero is a different fixture. Likewise, a deadline for review acceptance is not necessarily a deadline for completing the preparation itself.

Ask the appropriate owners to establish durations and required completion states. If a revised condition makes both orders fail, preserve that result. Do not remove a deadline or split an uninterrupted job simply to make the page look workable. A changed requirement needs a new calculation and an explicit agreement.

Check the completion ledger before closing

Ask another reader to reconstruct both orders, state which job misses its deadline, and explain why total occupied time stays six. If they claim the alternative is faster overall, correct the interpretation. If they inspect only the final batch time, restore the individual completion entries.

Retain the fixed inputs, boundary convention, both sequences, and job-specific lateness together. The finish condition is a sequence that satisfies every stated deadline, or a precise explanation of why the examined choices do not. It is a manual planning result, not an automatic Kiguri priority policy or a promise about real delivery.