How can two archive services share staff without losing their commitments?

In this constructed case, a public archive must decide how to allocate work for the next two weeks. Central copy-search assignments and local reference requests use the same archivists. The pilot’s central-priority rule permits interruptions of local work. One proposal retains central coordination but replaces automatic interruption with confirmed search intervals.

Use OPS.11 - Coordinate Interacting Operating Structures to coordinate that proposed allocation. Copy delivery also needs a branch specialist’s check; allocating search time does not allocate that checking time. The director must decide the arrangement, the participants must confirm their assignments, and both services must receive the resulting allocation. Use OCE.14 for the organizational revision itself.

A qualified specialist has supplied the professional procedure for checking a copy’s suitability and whether it may be supplied. The archive promises a suitable copy or a substantive response identifying the missing input or permission. The service owner counts a request as late when its promised deadline passes before the required result is delivered; unfinished requests past that deadline count too. After correction, both four-week windows include every eligible request.

Both proportions worsened; the observations do not establish why. The first pilot export showed 8 late copy requests out of 80; it omitted twenty other eligible requests, all late and unfinished at the window’s end. Recover their current state before planning: some may have since finished. Any remaining obligations retain their original dates and required results. OCE.13 supports the consequence comparison; OPS.8 needs the present waiting population.

For the limited-interval proposal, use OPS.8 to define a search-ready queue. A request enters it when a capable archivist has the inputs, access and permission needed for its next search. The proposed release rule sends an eligible search into a confirmed interval and orders eligible work by the authorized priority rule. Requests awaiting an input remain visible with the missing contribution and their original waiting time. A search can be ready before its copy-checking result exists; that check is a later requirement for supplying the copy. Compare this rule with central dispatch that interrupts local work, including what each leaves waiting in both services. A protective buffer amount would require evidence about replenishment and the loss it should prevent; the case supplies no such amount.

Three archivists each have two free search hours a week for the next fortnight. OPS.10 gives a useful first bound: the proposed allocations offer at most twelve search hours in total, subject to confirmation. Search load above twelve hours cannot fit those allocations. Load at or below twelve still needs a timetable that respects readiness and individual windows, plus the checking and completion work. Ask the service owner for the remaining work by request, the usable intervals and the burden of interruptions, recovery and transition. No deadline probability follows from these totals or the lateness percentages. A capacity limit leaves the promised professional answer outstanding; it is not that answer.

Seven interruptions were recorded. If the proposed change is justified as a remedy for delay, OPS.9 asks whether interruption and recovery are the limiting mechanism, rather than, for example, a heavier request mix using the available service windows. Request representative histories connecting readiness, interruptions and restarts, work performed, checking and delivery, together with the resource calendars and work requirements. The histories should show whether otherwise ready requests lose usable intervals to interruption and restart, or whether their required work exceeds those windows even without such losses. Return a supported mechanism, a combination of mechanisms, or the next discriminating observation. The aggregate rates alone leave that diagnosis open.

The operating return is therefore a proposed release rule, a conditional twelve-hour search ceiling, and a request for the workload, timetable and checking allocation needed to compare the two arrangements. Existing local commitments and the unfinished copy obligations stay in that comparison. The pilot permission ends on Friday; a further two-week arrangement requires the director’s decision and confirmed assignments. Base the proposal’s justification on the corrected lateness figures: both services worsened, and the cause remains unresolved.

Once the applicable policy and resource basis are adequate, OPS.5–OPS.7 can answer the narrower admission, case-continuation and priority questions. After authorized use, compare the accepted results of both services with their commitments, retaining the same acceptance and delay definitions.