Part VI — Qualify Capacity and Coordinate Operating Structures
OPS.10 - Qualify Operating Capacity Under Variability
Status: Stable
OPS.10:0 - Use This When
Use this Method when demand, a proposed commitment, a queue policy or a resource change requires an answer about what the operation can support. Average utilization may look acceptable even though a deadline, skill requirement or protected service class cannot be met.
The first useful result is a capacity-and-service comparison for the actual demand, resource arrangement and horizon. It states usable resource time, required load, relevant variation, feasible alternatives, supported service consequences and uncertainty. It can establish a feasible option, a bound that settles the question, or a specific missing input.
Use an adequate existing result. When calculation is needed, start with a simple load/time bound and add the analysis the service question requires. Use OPS.9 when the limiting mechanism is itself unresolved. Use OPS.5 for an individual admission decision under an adequate capacity basis. A clinical staffing rule, engineering capability, labor condition or financial authorization is supplied by its own qualified practice.
When the needed calculation is missing, OPS.10.1 - Construct and Compare Operating Capacity Models develops finite, mean or probabilistic service consequences from the operating conditions. OPS.10.2 - Construct and Revise a Feasible Deadline Schedule develops resource sequencing, calendar placement and conditional time reserve for a finite delivery. Reuse an adequate calculation without repeating these constructions.
OPS.10:1 - Problem frame
Capacity is useful only relative to a service, resource capability, operating conditions and time window. Nominal resource hours, accessible hours, hours usable by the required skill or configuration, completed service visits and accepted operating results are different quantities.
Variability matters even when totals fit. Demand can arrive together, service can take longer, a provider can withdraw access, a qualified person can be absent, or failed work can return. The operation may have enough total hours and still miss a deadline because the needed hours occur at the wrong time or require incompatible resources.
OPS.10:2 - Problem
Average load divided by nominal capacity can conceal unusable time, setup, recovery, skill restrictions and rework. A favorable mean can also conceal long waits or losses for a protected service class.
The opposite response applies a sophisticated queueing model to every decision. That creates calculation effort and apparent precision without improving a bounded choice that a transparent schedule or stress scenario could already settle.
OPS.10:3 - Forces
| Force | Practical tension |
|---|---|
| utilization and timely service | Keeping a resource busy can consume the slack needed to absorb a burst or recover. |
| simple estimates and changing conditions | A mean estimate is cheap; its validity can disappear when mix, timing or availability changes. |
| pooling and capability | Shared time can help only where the resource can perform the required service under its conditions. |
| capacity and reversibility | Extra capacity can be costly or slow to obtain; scheduling and batch changes can be cheaper but have their own consequences. |
| explicit reserve and apparent waste | Unused capacity can look inefficient while protecting a specified response or recovery scenario. |
OPS.10:4 - Solution
OPS.10:4.1 - State the demand and service question
Name the accepted result, population, demand profile, horizon and service criterion. Distinguish a service-visit queue from the operation’s final accepted-result population. State whether the question concerns a hard deadline for known jobs, a mean delay, a probability of completion, a protected response class or a bounded overload scenario.
Recover the initial unfinished work and its remaining service requirements. Preserve the customer’s waiting origin when local release times differ. If a target is an existing commitment, keep its parties and authority; any change to the promise depends on its terms and the parties authorized to change it.
OPS.10:4.2 - Recover usable time and required load
For each necessary resource, identify capability, access, calendar, location, configuration and skill conditions. Deduct known unusable intervals only where they actually remove the needed service. Keep uncertainty about outages or absence separate from known deductions.
Translate each demand class into resource-time requirements under the supplied Method. Include normal setup, joint-resource occupancy, expected or scenario-specific rework, recovery and other consequential load. State which effects are already included in a service-time estimate so they are not counted again as lost capacity.
Use compatible units. Two hours of a specialist and two hours of a general resource are not four hours of interchangeable service. A test attempt and an accepted release are not two interchangeable outputs.
The first calculation is a necessary bound: for the work to fit, the load it requires from each resource must fit that resource’s usable time in the window. Passing that bound is not enough when precedence, arrival timing, simultaneous resources or non-interchangeable classes can prevent a schedule.
OPS.10:4.3 - Choose the smallest adequate service analysis
| Receiving question | Appropriate first analysis | What it can establish |
|---|---|---|
| Can these known jobs fit the actual windows? | A finite schedule using arrival, readiness, service, calendar and precedence data, or a necessary time/resource bound. | A feasible assignment; impossibility only when a necessary bound or complete valid search excludes the deadline. |
| What is a useful mean steady-state screen? | A queueing approximation whose population, service, routing, stability and dependence assumptions fit. | A qualified mean estimate, not a tail guarantee. |
| What happens under a specified disruption or burst? | A trace replay or explicit stress schedule, with actual policy and resources. | A conditional scenario result, not its probability of occurrence. |
| Does a changing or coupled operation meet a probabilistic service target? | A stochastic model or simulation of the relevant inputs and policy, retaining parameter and model uncertainty. | A conditional service probability; reliance on actual service additionally needs the corresponding input and model basis. |
For a single continuously available compatible server operating first-come, first-served, a finite calculation can be very small. For each job in arrival order, start is the later of its arrival and the previous finish; finish is start plus service time; wait is start minus arrival. This assumes no other setup, interruption, precedence or resource requirement. Add those conditions to the schedule when they apply.
For a finite overload or changing regime, use a model that represents the initial state and the relevant time window. Correlated bursts, feedback, blocking, priorities and skill classes may require a different model. If specialist analysis is needed, supply the operating question and the conditions that analysis must cover.
OPS.10:4.4 - Test variability and the proposed change
When deciding whether to change the arrangement, compare the current arrangement with the proposed alternatives where they differ, such as demand/admission changes, timing, usable access, skill coverage, batch/setup changes, pooling or segregation, reserve, recovery and capacity acquisition.
Keep the result and service criterion fixed. Inspect arrival patterns as well as total demand, service and recovery variation as well as average duration, and common-cause losses as well as independent failures. Test plausible adverse conditions that could change the choice or the service claim supporting it.
A batching change may reduce setup time while delaying the first result or defect feedback. A pooled resource may improve a mean while changing a tail or protected class. A reserve must name the disturbance and capability it covers. A proposed schedule must not claim improvement by moving waiting outside the measured start boundary.
Use C.11.CRC for the finite comparison of consequences, resource cost, transition, reversibility and affected options. Keep a recommendation, provision of the resource, authority to use it and the resulting performance separate.
OPS.10:4.5 - State exactly what the result supports
Name each result as a hard bound, a feasible schedule under stated inputs, a stress scenario, an estimated mean, a percentile/probability forecast or an unresolved question. Attach the relevant uncertainty, data window and model limitations. Historical coverage of a target is not automatically its future probability.
For a consistently defined population with stable compatible averages, Little’s relation L = λW connects mean in-system count, effective flow rate and mean time. Returns, rework, abandonment and finite-window boundary terms need correct population accounting. The arrival/exit rate of service visits is not necessarily the rate of accepted final results. The relation is useful for consistency; it neither supplies a delay distribution nor makes a protective buffer sufficient.
If the available basis supports only a load bound, return the bound. If the question also requires a service result the bound cannot establish, identify the missing information. A missing distribution does not prevent a known infeasibility result or a useful conditional stress comparison.
OPS.10:4.6 - Return the operating decision and refresh basis
Return demand and result units, horizon, usable capacity and load assumptions, the selected analysis, the consequences of any alternatives compared and the supported option, bound or unresolved question, provision/decision authority, residual demand and reopening conditions.
OPS.5 can use this basis for admission. OPS.8 can use it for release and protection. Use OPS.7 when capacity evidence bears on the feasibility or continued support of an existing commitment. Use OPS.13, or an appropriate method from the responsible service practice, to establish a wider credible service offer; the local capacity result alone does not supply it.
Reopen when mix, arrivals, access, capability, absence, failure/rework, resource coupling or the service criterion changes. Retain observations of actual performance so the next decision can test, rather than silently inherit, the previous model.
OPS.10:5 - Archetypal Grounding
OPS.10:5.1 - PumpWorks: fit, reserve and a deferred package
In this constructed extension, four eligible test packages each require two consecutive rig-hours, including their normal setup, under the current estimate. In the next eight-hour horizon, this operation has access during hours 0–6; hours 6–8 are currently reserved for another use. This gives six continuous usable rig-hours. Permission and required configuration for the tests are current; release authority and SafetyQuestion-S19 remain separate.
The initial load is eight rig-hours, so all four packages cannot fit the six usable hours even before uncertain recovery. More ready packages or a larger buffer cannot remove that deficit.
For comparison, assume one adverse scenario: one of the planned packages needs a single consecutive two-hour repeat, after which it passes. The failed attempt is identified on completion and its repeat can run next under the current test conditions. This is a supplied scenario, not an estimated failure probability. The resource owner can offer hours 6–8 to this operation through a separate access and cost decision that accounts for the displaced use.
| Option | Usable rig-hours | Planned packages | Explicit reserve | Accepted test packages without repeat | Accepted packages in the one-repeat scenario |
|---|---|---|---|---|---|
| current access, plan three | 6 | 3 | 0 | 3 | 2, with unfinished load returned |
| extra access, plan three | 8 | 3 | 2 | 3 | 3 |
| extra access, plan four | 8 | 4 | 0 | 4 | 3, with unfinished load returned |
Both eight-hour options deliver at least three accepted packages in either stated scenario. Planning three and reserving two hours completes every admitted package in both. Planning four can deliver four without a repeat and leaves one unfinished if a repeat is needed. The six-hour option can fall to two. Compare the cost of extra access, the displaced commitment and the consequences of admitting work that may return unfinished.
If the decision requires every admitted package to finish in either scenario and the resource owner grants the extra access, admit three, reserve two hours for the repeat and return the fourth package to OPS.5. Send any affected existing commitment to OPS.7. If extra access is unavailable, use the six-hour result.
More than one repeat, a longer repeat, changed configuration or another loss reopens the comparison. A passed test package still does not settle the release decision for R42.
OPS.10:5.2 - Equal total load, different waiting
One continuously available server processes four one-hour jobs. There is no setup, failure, other resource or initial backlog.
| Scenario | Arrival times in hours | Start times | Waiting times |
|---|---|---|---|
| one burst | 0, 0, 0, 0 | 0, 1, 2, 3 | 0, 1, 2, 3 |
| one job per hour | 0, 1, 2, 3 | 0, 1, 2, 3 | 0, 0, 0, 0 |
Both consume four server-hours and finish the last job at hour 4. If the criterion is completion within two hours of arrival, two of four jobs meet it in the burst scenario and all four in the second. The difference follows from the stated arrival scenarios.
Measure arrival-to-completion time from the actual arrival. If a job waits for admission, starting its clock at admission omits that wait.
OPS.10:5.3 - Nominal beds and qualified capacity
A hospital’s bed count is not the capacity for every care requirement. The receiving question may depend on the supplied clinical class, staffing qualification, equipment, cleaning readiness, access and synchronized availability.
Use the applicable clinical and staffing results to compare arrangements and state the resource-time or scenario result. If a required qualification is missing, identify which service capacity remains unresolved and the evidence or decision needed to establish it.
OPS.10:6 - Bias-Annotation
| Bias | Consequence | Countermeasure |
|---|---|---|
| nominal-capacity bias | Calendar presence substitutes for usable capability and access. | Recover the relevant service and resource conditions. |
| average sufficiency | Equal totals are treated as equal service. | Inspect arrival timing, variation and the actual service criterion. |
| double-counted loss | A failure is included in service time and again deducted from capacity. | State each estimate’s contents and count the effect once. |
| precise-number confidence | A sophisticated model hides poor premises. | Match model scope to the question and qualify the result kind. |
| reserve-as-waste bias | Recovery capacity is removed to increase utilization. | Compare the named disturbance and service consequence. |
OPS.10:7 - Conformance Checklist
- Are demand, service visits, accepted results and the waiting origin distinct where they affect the calculation?
- Does usable capacity include the actual capability, access, calendar and joint-resource conditions?
- Does required load include relevant setup, recovery and rework without double counting?
- Does the chosen analysis fit the finite/steady, deterministic/stochastic and dependence conditions?
- Are the service criterion, uncertainty and adverse scenarios explicit where they affect the capacity claim or the option comparison?
- Does the result distinguish its supported claim from resource provision, authority and a service promise?
- Can the receiving admission, queue or commitment decision use the result and identify its reopening condition?
The calculation is recognizable when another practitioner can reproduce its inputs and outputs. Assurance requires the empirical and professional basis appropriate to the claimed bound, model or forecast.
OPS.10:8 - Common Anti-Patterns and How to Avoid Them
| Anti-pattern | Failure | Repair |
|---|---|---|
| Total demand is below total hours, so the deadline is safe. | Timing, precedence or incompatible capability can prevent a schedule. | Recover the actual resource windows and a feasible witness. |
| Use mean utilization as a service guarantee. | The wait distribution and relevant tail remain unknown. | State the intended service criterion and select a suitable analysis. |
| Treat a scenario as a probability. | No occurrence model or calibrated data supplies that probability. | Label the conditional result and return the missing probabilistic basis. |
| Treat every person or machine-hour as interchangeable. | Capability, configuration and access differ. | Compare usable service capacity by the relevant class. |
| Count repeats as additional delivered results. | Attempts and accepted outputs have different identities. | Keep load and result populations separate. |
| Buy capacity before establishing the limiting mechanism. | The added resource may not change completion. | Use OPS.9 where the treatment basis is unresolved. |
OPS.10:9 - Consequences
The operation can distinguish known infeasibility, conditional feasibility and supported service uncertainty. Admission and protection decisions can use reserve deliberately rather than treating all unused time as waste.
The cost is maintaining resource and workload premises that can change. A modest schedule can be enough for a small finite decision; a consequential probabilistic promise may need substantial specialist modeling and evidence.
OPS.10:10 - Rationale
Usable capacity, workload and service are related but different. A load bound can show that a required resource has too little usable time. If total hours fit, their timing and compatibility may still prevent delivery. A schedule answers whether that time can be used as needed. A service forecast adds a claim about uncertain outcomes. Keeping these questions separate prevents a cheap answer to one from being mistaken for an answer to all three.
OPS.10:11 - SoTA-Echoing
| Practice question and selected line | Serious alternative, trade-off and pattern change | Source roles, limits and reopen condition |
|---|---|---|
| Can average population and flow data establish timely service? Adopt compatible population accounting; reject using a mean identity as a tail guarantee. | Mean utilization cannot distinguish the two arrival scenarios in 5.2. A mean-flow identity can recover different mean times from compatible population data, but does not establish their two-hour completion fractions. Sections 4.1, 4.3 and 4.5 retain the service criterion and result kind. | Little (2011) relates compatible averages of population, flow and time. Individual deadline performance requires additional timing information. The finite example provides the decision-changing contrast at comparable calculation effort. Reopen when the population, boundary, returns or required service claim changes. |
| What model should handle dependent arrivals and feedback? Adapt model selection to the actual temporal and network dependence. | A simple independent-input mean approximation is easier but can omit consequential burst structure. Sections 4.3–4.5 call for a suitable specialist model when the omitted dependence could affect the choice or the grounds for the requested performance estimate. | Whitt and You (2022) is a bounded model candidate: a single-class open single-server network with Markovian routing, nonrenewal arrivals and feedback, estimating mean steady-state performance through dispersion functions. It does not supply every service tail or transient solution. Reopen for nonmatching routing, classes, regime or service criterion. |
| Should the response be more capacity, pooling, or a different batch policy? Adapt finite comparison of setup, waiting, reliability and service effects. | Capacity additions can be lumpy; smaller batches and pooling can have different protected consequences. Sections 4.2–4.4 and 5.1 retain those costs and scenarios when deciding which arrangement supports the required service. | Reinertsen (2009), batch-size trade-offs, supplies a mechanism candidate. Andradóttir et al. (2017) and Cao et al. (2021) supply conditional pooling counterexamples. Their studied conditions are not transferable staffing or rig prescriptions. Reopen when capability, failures, batching or the service criterion changes. |
OPS.10:12 - Relations
OPS.3 and OPS.4 supply the matching subjects, resource relations and qualified current observations. OPS.8 supplies the release/queue/buffer policy whose consequences are analyzed. OPS.9 supplies a supported limiting mechanism when choosing a capacity treatment depends on it. OPS.11 handles consequential cross-structure constraints.
OPS.5 consumes an adequate capacity basis for admission; OPS.6 continues permitted Work without treating the plan as performance; OPS.7 uses changed feasibility for an existing bounded commitment. OPS.13 and OPS.14 use the capacity basis with their own service and financial inputs to address the wider commitment and operating-consequence decisions.
Current FPF C.16, C.27.TA/C.27, C.11.CRC and C.11 govern measurement, temporal interpretation, finite comparison and choice. Field specialists supply the capability, labor, engineering, clinical, safety and financial premises for their respective uses.
OPS.10:End
OPS.10.1 - Construct and Compare Operating Capacity Models
Type: Method pattern Status: Stable Normativity: Normative
OPS.10.1:1 - Problem frame
Use this when you know the service question and operating arrangement, but the calculation needed to answer it is missing or misleading. A faster machine produces longer queues. Two staffing plans have the same average hours but different completion risks. A workload controller changes an aggregate smoothly while the customer is waiting for one complete order.
Model how the available resources produce the required result, then calculate the service result under the stated conditions and for any proposed changes. Keep the arrival, service, resource and completion meanings attached to the quantities. The result can be a finite schedule, an obstruction, a mean estimate, a conditional probability or a useful bound.
First useful move. Select one result and its time criterion. Recover who or what must serve it, what is already waiting and whether anything prevents the next service from starting. A resource-time shortfall may settle the question immediately.
The reader needs to interpret rates, durations and elementary probability for the branches used. A practitioner can obtain a specialist calculation while retaining the operating assumptions and result interpretation. Use an adequate existing model directly; reconstruct it when a changed resource, arrival process or question invalidates a needed relation. OPS.10 selects the wider capacity/service decision. This method develops the model used in that decision.
OPS.10.1:2 - Problem
Dividing mean demand by nominal capacity suppresses the arrangement that makes service possible. It can hide shared attention, interrupted availability, burst arrivals and visits that fail to produce a final result. A mean waiting-time formula can then be used to promise a deadline it never calculated.
At the other extreme, a full simulation can consume effort while leaving a simpler decisive bound unused. The difficulty is to model enough of the service process to answer the question and identify which assumption or relation needs revision when the model is insufficient.
OPS.10.1:3 - Forces
| Force | Practical tension |
|---|---|
| Amount and timing | Enough total resource time may exist, yet be unavailable when a job needs it. |
| Detail and useful consequence | A richer model can retain a lost dependency, but also cost more to build and maintain. |
| Average performance and individual service | A mean can compare recurring load without determining a completion probability or hard deadline. |
| Local change and shared work | Speeding one activity can move waiting or consume a resource needed elsewhere. |
OPS.10.1:4 - Solution
Model how work arrives, uses resources and reaches completion. For a choice between alternatives, calculate the answer to the same service question for each. If an assumption fails, revise it and the results that depend on it. Enter at a later step when its inputs are already adequate.
OPS.10.1:4.1 - Define the completion question and its clock
Choose the operating population, arrival event, completion event and horizon. Keep an order, its visits and its accepted result distinct. For each alternative, measure customer waiting from the same event unless the question concerns that starting event.
State the output needed: all listed jobs finished by a date; a mean residence time in a continuing regime; a fraction completed within a duration; a probability under a specified model; or protection against a stated disturbance. Recover the initial unfinished work and its remaining requirements. A system started empty is a different input from a busy operation observed halfway through a shift.
For example, “the two jobs need four hours on average” does not yet answer “with what probability will both be complete by hour four?” Section 5.2 constructs both answers from the same service assumptions.
OPS.10.1:4.2 - Construct usable service and a first load bound
Use the operating model to identify the resources needed by each activity, including simultaneous needs. Recover usable calendars, capabilities, access, setup, interruption, restart and return rules. An unattended machine interval may occupy the machine while releasing its operator.
For a finite horizon, sum the required remaining occupancy separately for each resource. Compare it with the time in which that resource can perform this work. If the requirement exceeds that time, the proposed completion is impossible under those inputs. If it fits, timing, precedence or resource compatibility may still prevent a schedule.
For recurring demand, a useful first load expression is:
resource demand per unit time =
sum over arriving classes of
(class arrival rate * expected resource time used by one arrival)
Expected resource time includes the modeled visits, setups and recovery attributable to that arrival. A return may require another visit without producing another delivered order. If return behavior depends on congestion or policy, recover that dependence before reusing the old expectation.
Divide this demand by the usable resource time supplied per unit time to obtain an offered-load ratio. A ratio above one means that offered work exceeds this capacity. The observed fraction of time busy remains at most one. Both measures can be useful, but they answer different questions.
Define service time for the chosen server. Include an interruption in effective service when the model treats it as extending that server’s service; otherwise represent the unavailable interval separately. Count its loss once. Waiting for another team or for permission is not automatically occupancy of this server. A batch’s shared machine time is also different from the sum of its parts’ elapsed times. OPS.11.1 and OPS.15.1 supply these resource and event constructions.
OPS.10.1:4.3 - Build the finite or changing-regime account
For a continuously available single server, first-come service, known arrivals and service durations, construct each start and finish in arrival order:
start[i] = max(arrival[i], finish[i-1])
finish[i] = start[i] + service[i]
wait[i] = start[i] - arrival[i]
The initial finish represents the server’s remaining occupied time; it is zero for an empty system available at zero. This recurrence obtains the earliest schedule under that fixed policy. It does not choose a better job order.
When a job needs an uninterrupted usable interval, replace the proposed start by the first interval that fits its duration and required resources. If work can pause, account for the work completed before each interruption and the permitted restart, including lost setup or recovery. Construct precedence and resource choices explicitly when several activities interact. OPS.10.2 develops this finite schedule, including calendar windows and conditional time reserve. A feasible placement shows that the schedule fits the modeled conditions. Distinguish a search that finds no schedule from a complete valid exclusion of every permitted placement.
For a changing regime, begin with the actual initial state and advance arrivals, completions, failures, returns and control actions using their event rules. A model of continuous aggregate quantities can use fewer variables when amounts and rates are the required outputs: write its accumulation balance and the rule that determines outflow. Retain any capacity, nonnegativity and delay constraints of that rule. Section 5.3 shows why a proportional outflow and a constant service rate give different completion accounts.
A feedback policy can be part of either an event or continuous model. Its requested capacity change must correspond to an obtainable operating change, such as an available shift, machine setting or additional resource.
OPS.10.1:4.4 - Construct a continuing-regime mean when that is the question
First establish the modeled regime: arrival process, service order, number of servers, availability, initial transients, return behavior and relevant dependence. Long-run parameters do not describe an arbitrary finite overload merely because their units fit.
For one continuously available first-come server, consider independent, identically distributed interarrival intervals and independent, identically distributed service times, with the two sequences independent. Let lambda be the arrival rate, E[S] the mean service duration and rho = lambda * E[S]. With finite second moments and rho < 1, a useful two-moment approximation is:
mean queue wait ≈ ((ca² + cs²) / 2) * rho / (1-rho) * E[S]
mean residence ≈ mean queue wait + E[S]
Here ca² is interarrival variance divided by squared mean interarrival time; cs² is service-time variance divided by squared mean service time. The factor rho/(1-rho) retains the sharp rise near saturation. Both arrival and service variation matter.
Use this as a qualified mean calculation under those premises. In the Poisson-arrival case, the displayed mean wait equals the established single-server result for a general independent service distribution with finite second moment. Section 5.1 uses that special case. Neither use supplies a wait percentile.
Temporal dependence can defeat a description consisting of two moments. Count arrivals in windows at time scales relevant to the queue; examine whether their variance relative to mean changes with window length. Retain that dependence in a richer queue model or in simulated arrival paths when it matters to the required service result or the choice that depends on it. Dispersion-based queueing analysis supplies one such mean-performance alternative; it retains its own stationarity and service assumptions.
Do not substitute the one-server formula after pooling servers, adding priorities, introducing blocking or changing the dependence. Reconstruct the model of service. A deterministic arrival every hour and a one-hour uninterrupted service can operate continuously without a queue; its feasible timing is not invalidated by a stochastic formula singular at rho = 1.
OPS.10.1:4.5 - Obtain the needed probability or protective bound
For a finite probability question, specify the joint uncertain inputs, initial state and operating policy. When a policy adapts during execution, base each choice on information available at that time. Separate schedules chosen after each complete outcome is known do not establish one policy that can be executed. State the service event, such as both named orders completing by hour four. Derive its probability directly from the joint model when possible. Alternatively, apply the event rules to enumerated outcomes and sum their probabilities, or to sampled paths and estimate the probability with its sampling uncertainty. MMP.7, MMP.13 and CMP.9 supply observation, inference and sampling methods when those contributions are needed.
Preserve dependence between arrivals, service durations, outages and returns. Equal marginal means or distributions do not make different joint models equivalent. Section 5.2 changes only service dependence and changes the probability while preserving the mean completion time.
A scenario without probabilities supports a conditional consequence. A family of bounded disturbances can support a protective bound if the response is shown to work for every disturbance in that family. One successful replay supplies only its case. A mean replenishment time multiplied by a consumption rate gives no such worst-case or probability statement by itself.
Include the starting backlog and horizon for a transient service question. Use a continuing-regime mean only for the mean question it answers. For an empirical claim, interpret source coverage and input/model uncertainty as well as calculation or sampling error. Obtain another observation when it could improve the required service estimate or the decision enough to justify its cost.
OPS.10.1:4.6 - Compare operating changes and return their consequences
Change the modeled mechanism of each alternative: service requirement, resource access, setup, interruption, release, route or policy. Recalculate the affected consequence while preserving unaffected inputs and the common service question.
Compare the relevant results separately: completion, waiting, resource demand, cost, burden and recovery. Use the existing finite-comparison or portfolio methods when these consequences compete. A faster nominal operation can lose to a more predictable one on mean residence, yet remain preferable at another arrival rate or cost.
Distinguish waiting moved before admission from service made faster by reduced interference. The first can improve an internal measure without earlier delivery; the second needs the changed service mechanism in the model. Return the result to admission, release/protection or commitments together with the conditions that can change it. A modeled resource does not establish that it has been provided or authorized.
Stop with the answer the decision needs: a usable alternative, demonstrated shortfall, sufficient bound or an identified unresolved relation. Reopen the affected calculation when arrivals, mix, service, access, dependence or the requested service criterion changes.
OPS.10.1:5 - Archetypal Grounding
OPS.10.1:5.1 - A slower machine gives a better mean, within its capacity
Jobs arrive as a Poisson process at one job per three hours. A continuously available first-come machine serves one job at a time; its service durations are independent across jobs and of arrivals. Service includes all job-specific recovery. There is no other setup, loss, resource or return. These are constructed alternatives.
Machine A takes one hour with probability 0.9 and eleven hours with probability 0.1. Its mean service is two hours, its variance is nine squared hours and cs² = 2.25. Machine B always takes 2.2 hours, so its service variance is zero. Poisson arrivals give ca² = 1.
| Result | A | B |
|---|---|---|
| Mean service, hours | 2 | 2.2 |
| Offered-load ratio | 2/3 | 11/15 |
| Mean queue wait, hours | 6.5 | 3.025 |
| Mean arrival-to-completion time, hours | 8.5 | 5.225 |
For example, A’s mean wait is ((1+2.25)/2) * ((2/3)/(1/3)) * 2 = 6.5. The special-case mean relation applies to these stated service laws. B has the larger mean service duration and higher load ratio, yet the smaller mean residence. Its absence of service variation changes the queue consequence.
If the decision needs a mean residence below six hours, B meets that modeled criterion and A does not. Cost and actual availability still affect the operating choice.
Change the arrival rate to 0.48 jobs per hour. A’s mean service rate is 0.5 and B’s is about 0.455. A has load ratio 0.96, while B has 1.056. The former comparison cannot justify B for that continuing arrival regime. Review the admission or capacity arrangement at the increased demand. The steady-mean formula used here requires a load ratio below one.
OPS.10.1:5.2 - Four hours on average, with a missed-deadline risk
Two independent jobs are ready at time zero. One server processes them in fixed order without interruption. Each service takes one or three hours with probability one half, independently of the other service. Both jobs must be complete by hour four.
| Service durations, hours | Last completion, hour | Probability | Both complete by four? |
|---|---|---|---|
| 1, 1 | 2 | 1/4 | Yes |
| 1, 3 | 4 | 1/4 | Yes |
| 3, 1 | 4 | 1/4 | Yes |
| 3, 3 | 6 | 1/4 | No |
Mean last completion is four hours; the probability of meeting the deadline is three quarters. Replacing both durations by their mean of two hours would produce a single on-time schedule and discard that risk.
An additional independent server capable of the same work would allow both to start at zero and finish by three in every listed case. That is a conditional alternative; obtaining it is another operating action. Without it, a deadline of six covers all cases in this bounded model.
Now keep both marginal service distributions but make their durations equal, perhaps because a shared job condition affects both. The only outcomes are (1,1) and (3,3), each with probability one half. Mean last completion remains four; deadline probability falls to one half. The changed dependence reopens the probability result without changing the two means.
OPS.10.1:5.3 - An aggregate curve and a completed job
A controller represents remaining workload q in job-equivalents, starting at one with no new arrivals. Its assumed output rate is k*q, with k = 1 per hour. The balance gives q(t) = exp(-t): after one hour, about 0.368 job-equivalents remain. This model can support an aggregate regulation question where that outflow law fits.
A different operating account says one indivisible job takes exactly one uninterrupted hour on the available resource. Its completion event occurs at hour one. A constant-rate fluid balance, stopped at zero, also gives q(t) = max(1-t,0) in job-equivalents, but its intermediate fractions do not make the actual job partially delivered.
Even the exponential curve permits another interpretation under different premises. For one exponentially distributed service duration with mean one hour, it is the expected number of unfinished jobs; completion by one hour then has probability about 0.632. It is not a deterministic promise.
The practitioner chooses the account by the receiving question and the operating service law. For the fixed one-hour deadline, use the completion event. For aggregate feedback, establish the outflow relation and how a commanded rate change can be realized. A new capacity setting without a corresponding operating mechanism leaves the proposed intervention unsupported.
OPS.10.1:6 - Bias-Annotation
Nominal speed attracts attention because it is easy to compare. Section 5.1 keeps recovery variation and queue consequences visible. A smooth trajectory can be equally persuasive: section 5.3 recovers what the curve represents before interpreting it as a completed result.
A familiar formula can survive after its regime disappears. Reconstruct the changed arrival, service or dependence relation and recompute the service quantity under the applicable model.
OPS.10.1:7 - Conformance Checklist
- Are the completion event, clock and service criterion clear before the calculation?
- Are usable resources and each job’s demands represented, with shared occupancy and losses counted once?
- Does a finite schedule preserve the initial backlog, policy, calendars and precedence it uses?
- Does a continuing-regime calculation retain its arrival, service, dependence and stability premises?
- Is a probability derived from the joint uncertain model, and a protective bound from its stated disturbance family?
- Does the comparison distinguish a changed service mechanism from a changed measurement boundary?
- Can admission, protection or commitment use the result and identify what would reopen it?
Recognition and assurance. A reproducible conditional calculation is a model result. For reliance on actual service, establish the resource availability and input assumptions on which the service claim or decision depends, at the assurance level the work requires. Missing information may leave a probability unknown while a resource bound still settles the decision.
OPS.10.1:8 - Common Anti-Patterns and How to Avoid Them
| Tempting move | Consequence | Repair |
|---|---|---|
| Replace the utilization factor by the busy fraction alone. | The rise in waiting near saturation disappears from the mean calculation. | Retain rho/(1-rho) with the selected model’s premises. |
| Put mean durations into one schedule and report its deadline as assured. | Different uncertain paths collapse into an unrepresentative outcome. | Calculate the required predicate over the joint paths or derive an applicable bound. |
| Deduct interruption time after already including it in effective service. | The same capacity loss is counted twice. | Choose a consistent service/availability representation. |
| Apply the old one-server model after pooling resources or changing service dependence. | The mathematical account no longer describes the proposal. | Reconstruct the affected service mechanism before comparing its result. |
OPS.10.1:9 - Consequences
The practitioner can obtain a capacity comparison from the smallest sufficient construction and see which operating change would alter its conclusion. Mean, scenario, deadline and probability questions remain connected without substituting one answer for another.
The cost grows when dependence, calendars or uncertain service matter. A bounded decision may finish with an elementary obstruction; a probability-sensitive decision may need richer modeling and input support.
OPS.10.1:10 - Architectural Rationale
To compare capacity choices, explain how available resources perform activities under a policy and produce the required results. Observations, estimates or stipulated case inputs supply the quantities; the mathematical model relates them, and solving it gives the consequences under its premises. Their correspondence to the operating work determines what a calculation answers.
The construction therefore separates what the resources must do, how their service evolves and which result is requested. The same arrangement can need a finite deadline model today and a continuing mean model for another decision. Cases 5.1–5.3 show changes of variation, dependence and interpretation that a single scalar capacity value cannot retain.
Common model construction, inference and comparison remain in their supplying Methods. Use the operating arrangement and evidence to select the service laws and assumptions that the capacity calculation requires.
OPS.10.1:11 - SoTA-Echoing
For a quick mean comparison of one continuing first-come server, adopt the service-process and two-moment construction in Hopp and Spearman, Factory Physics, third edition, §8.6.5, equations 8.25–8.26. A utilization-only calculation is cheaper but loses the action-changing service variation in section 5.1. Sections 4.2 and 4.4 retain both variance contributions, the saturation factor and their premises. The formula is a mature approximation with a useful exact Poisson-arrival special case. Its low calculation cost is accepted for the mean question; a changed operating regime or a required deadline probability reopens the choice.
For dependent traffic, adapt the richer description developed by Whitt and You (2022), §§2.1–2.2: count dispersion over time retains variability a fixed two-moment description can lose. This costs additional traffic characterization. Section 4.4 selects that effort when the lost dependence matters. Their robust-queueing construction approximates mean performance in a steady regime under its stationarity and independent-service assumptions. Although the derivation uses a worst-case construction, the returned result estimates a mean; it does not guarantee an upper bound on individual waits. Changed dependence, routing or the requested result reopens that use.
For changing aggregate workload, Oliveira, Sagawa and Mušič (2025), §§3–4, supplies a current continuous feedback-control alternative. Adapt its explicit accumulation and capacity-response account for a suitable aggregate question; reject treating continuous versus discrete representation as the test for whether feedback is possible. Sections 4.3 and 5.3 retain the outflow law, completion interpretation and obtainable capacity change. An event model requires individual timing detail and is preferable when that detail decides the deadline. The paper’s simulated control response does not establish physical access or every individual completion. Reopen when a changed service law or required completion event invalidates the chosen correspondence.
The finite probability and changed-dependence case is a direct construction from its stated premises. It avoids a simulation project for four enumerable outcomes. Use a larger probabilistic construction when the joint inputs or the risk question being answered require it.
OPS.10.1:12 - Relations
OPS.10 selects the capacity/service decision. OPS.10.2 constructs the detailed deadline schedule and its conditional reserve. OPS.11.1 supplies the shared-resource and completion model; OPS.15.1 constructs the operating quantities. OPS.9 diagnoses an unresolved limiting mechanism. OPS.5, OPS.8 and OPS.13 use capacity results in admission, protection and commitments; OPS.19 reconciles simultaneous operating work.
MMP.10 supplies constraint construction, MMP.11 the response formulation and MMP.7 and MMP.13 the observation and inference contributions. CMP.9 supplies a randomized estimator when enumeration is insufficient. C.29 qualifies returning a mathematical result to its operating subject; C.16 preserves quantity meaning, and C.11/C.11.CRC supply common comparison and decision-use discipline.
OPS.10.1:End
OPS.10.2 - Construct and Revise a Feasible Deadline Schedule
Type: Method pattern Status: Stable Normativity: Normative
OPS.10.2:1 - Problem frame
Use this when particular work must deliver particular results by particular times, but a list of tasks and estimated durations does not establish whether the work fits. Two ready tasks compete for one specialist. A test needs an uninterrupted window. A delayed input changes which remaining operation can now postpone delivery.
Determine whether the required operations can fit their time and resource conditions. A feasible schedule shows how to meet the deadline. A sufficient bound or complete search can show that no such schedule exists. If neither result is available, state what is still unresolved. For a feasible plan, determine which delays it can absorb. Reconsider affected results when a condition changes.
First useful move. Name the recipient’s completion event and deadline. Trace the remaining operations to that event, including required handovers and acceptance. Identify the performers, equipment and calendar windows shared by the operations. OPS.11.1 supplies that operating account; OPS.15.1 supplies event and clock interpretation.
Practical gain. The planner can state what should start when, which reservations matter, how much postponement is still possible under the chosen arrangement, and what change could recover a threatened commitment.
This method addresses finite delivery timing within the broader capacity and service question of OPS.10. Its subject is the proposed schedule, not the performed work or a new customer promise. Use an adequate existing schedule directly when its conditions still answer the question. Use OPS.10’s demand and capacity analysis when the question instead concerns sustained throughput or a distribution of future delays.
The elementary cases need time intervals, arithmetic and a dependency diagram or equivalent list. A large search may need a scheduling specialist. For known jobs and durations, a deterministic calculation can answer the finite scheduling question.
OPS.10.2:2 - Problem
A dependency diagram can allow work to proceed in parallel while the same person must perform both branches. A resource total can fit a day while a continuous operation fits none of its open windows. A priority rule can produce a late plan even though another order meets the deadline.
A second error arises after a plan has been obtained. Its apparent spare time is spent independently by several participants, or a once-critical sequence continues to determine priorities after resource access has changed. The practitioner needs a construction that connects the proposed times, their feasibility, the reserve being used and the conditions requiring revision.
OPS.10.2:3 - Forces
| Force | Tension |
|---|---|
| Early results and shared resources | Advancing one result can postpone another. |
| Compact model and consequential detail | Whole-operation durations are convenient, but attendance phases or calendar gaps can decide feasibility. |
| Fast plan and strong conclusion | A useful candidate may be easy to obtain; optimality or impossibility needs an additional argument. |
| Deferred starts and protection | Waiting can reduce aging or premature work while consuming opportunities to recover delay. |
| Stable coordination and changed facts | Keeping appointments has value, but preserving an invalid order can lose the delivery. |
OPS.10.2:4 - Solution
Recover the recipient’s result and deadline and the operations needed to deliver it. Identify what enables each operation, which resources it occupies and the usable calendar windows. Seek a feasible schedule or a sufficient obstruction. A failed placement leaves other allowed schedules open unless a bound or complete search rules them out. For a feasible plan, calculate the start windows and delivery reserve needed to compare early work, postponement or protection. When a condition changes, retain completed facts, reconsider the affected dependencies and resource competition, and return the consequences to whoever can set priorities or authorize release.
OPS.10.2:4.1 - Recover the delivery question and remaining work
State the result that must be available, its deadline and its waiting origin. An internal completion can precede transport, approval or receiving acceptance. Include those operations when the promise needs them.
Separate hard requirements from preferences. “Meet all three dates” asks for feasibility. “Finish the last order as early as possible” minimizes the last completion. “Obtain the first result sooner” can prefer a different order. If competing recipients cannot all receive their earliest possible result, OPS.7 supplies the priority and commitment choice.
For each remaining operation, recover its readiness event, required predecessors, duration or bounded scenario, eligible resources, and whether it can be interrupted. Include setups, transfers and known return work when they consume relevant time. Retain completed operations and work already under way as facts; estimate only their remaining requirements.
Qualify the duration before calculating a schedule. Recover the execution conditions and whether the quoted time includes waiting or deliberate protection against overruns. A protected task commitment is not, by itself, a measure of the time the work takes. Keep work and required waiting in the timing model, and identify protection already included before reserving more time for the same delays. If that split is unknown, obtain a supported estimate or compare explicit duration scenarios; cutting every quotation by the same percentage does not recover the missing basis.
Keep the finite work list at the detail the decision needs. If a task requires an operator only during loading, recover that phase without decomposing every machine movement. If an uncertain duration affects feasibility, the scope of the service claim or a choice between plans, compare supported bounds or obtain that particular input. A full event history is unnecessary when the supplied conditions already settle the schedule.
OPS.10.2:4.2 - Construct precedence, occupation and calendar conditions
A precedence relation states which event must occur before another operation may begin. For a continuous operation i of duration p_i, finish f_i equals start s_i plus p_i. A finish-to-start relation from i to j with required delay l requires s_j >= f_i + l. At a join, every required predecessor must satisfy its relation. An actual partial handover can use an earlier event, provided the downstream work can use that partial result.
Resource sharing adds a different condition. Two operations requiring the same exclusive resource cannot occupy it at the same time. Their order is a choice unless the operation already fixes it. For a pool, check how many eligible members are needed simultaneously; one free but unqualified person does not supply the required capability.
Recover each occupation separately. A machine may hold an order for three hours while its operator is needed only in the first hour. Represent the machine interval and that operator interval with their common start. Apply each resource’s capacity and calendar to its own intervals. Use half-open intervals, including the start and excluding the finish, when a resource can pass immediately to the next operation.
Distinguish three calendar conditions that require different placements:
- A continuous occupation must fit wholly inside an available window.
- Work that may pause can accumulate processing across open windows, with any restart cost included.
- A machine may continue through an operator’s absence when that phase needs no attendance.
A rule allowing an operation to start during working hours does not establish that its later occupied hours are available. Where several resources are needed together, find a window in which their required occupations are jointly possible.
Check that the precedence relations can be satisfied. A finish-to-start cycle with positive total required duration and delay is an obstruction. When the work actually revisits a station, represent the later visit as a later operation rather than requiring one operation to precede itself.
MMP.10 supplies the joint formulation. Keep the operational reason for a condition recoverable: actual precedence, chosen resource order, calendar closure, admission policy or deadline. A chosen order can be reconsidered without pretending the technological route changed.
OPS.10.2:4.3 - Place the work and distinguish the resulting conclusions
For a small case, start with operations whose required predecessors have been placed. Choose an eligible operation, find its earliest jointly available placement after readiness, reserve the required intervals, and continue. Several reservations may be made within one long machine operation when its attendance phases allow other work.
At a resource conflict, compare the competing orders. A near deadline or a long downstream continuation can guide the first attempt. Preserve alternatives when that first attempt fails or gives an inadequate result. Inserting work into a gap, leaving a resource temporarily idle, or changing an uncommitted order can permit a schedule that a simple dispatch rule misses.
Once the relevant orders are fixed, calculate the earliest times consistent with them. With continuous availability and finish-to-start relations, each start is the maximum of its readiness and predecessor finishes plus their required intervening delays. Chosen resource-order relations also contribute predecessors. For partial attendance, connect the occupied phases, not the finish of an unrelated unattended phase. With calendars, move each proposed occupation to the next jointly permitted window and propagate the resulting finish.
Check the complete candidate against every required operation, precedence, occupation, calendar and completion event. A feasible assignment is a witness that the modeled work fits; the participants must still have the stated access and capability.
Use cheap necessary bounds before a larger search. A required dependency chain cannot finish faster than its ordered work permits. A resource cannot supply more mandatory occupation than its available capacity in the required window. A continuous operation cannot use several disjoint short windows as one long window. Passing these bounds does not construct a schedule.
Return the actual strength of the result:
| Obtained result | Supported conclusion |
|---|---|
| Complete feasible schedule meeting the dates | Those dates are attainable under the stated conditions. |
| Feasible completion C and lower bound L on the earliest possible completion | The optimum lies between L and C. Equality establishes an earliest completion. |
| Necessary condition incompatible with the deadline, or a complete valid search excluding every permitted schedule | The deadline is impossible within that modeled arrangement. |
| A failed priority rule, restricted sequence or interrupted search | That attempt found no satisfactory plan; other permitted schedules remain unresolved. |
CMP.4 supplies justified search when the operational choices remain numerous. CMP.5 supplies relaxations and bounds. Use an adequate existing bound or schedule. If a specialist must develop one, supply the relevant resource and calendar conditions and the conclusion to establish.
Stop when a suitable plan or sufficient obstruction answers the decision. Continue optimizing when a reachable improvement in the schedule or the bound justifies the additional work.
OPS.10.2:4.4 - Derive time reserve and conditional criticality
First state the event against which reserve is measured. If the proposed final completion is C and its deadline is D, D-C is the plan’s final margin. A negative value shows that this plan misses the deadline; it does not by itself exclude another plan.
For a precedence network with fixed durations, continuous calendars and no binding resource contention, calculate early starts forward and latest starts backward. Start the backward pass from the selected final time T, retaining any earlier hard intermediate deadlines. For each successor, subtract the required intervening delay from that successor’s latest start. The earliest of those bounds and any deadline on the operation gives its latest finish; subtract its duration to obtain its latest start. Latest start minus early start is its total float relative to those targets. Free float is the delay that leaves the successors’ early starts unchanged, including their required intervening delays.
When only the final event governs this calculation, setting T to the earliest final completion identifies zero-float paths controlling that completion. An earlier intermediate deadline can instead give zero float to work protecting that intermediate event; identify which event the result concerns. Using a later final deadline adds delivery margin where other commitments permit it, so an operation on the longest precedence path can have positive deadline float. Several longest paths can exist. Serial operations may draw on the same margin, so their individual floats are not independent allowances to add together.
With shared resources, retain the selected allocations and orders when making the timing calculation. For whole-operation exclusive occupations, add the chosen resource-order relations to the precedence network; its timing is conditional on those orders. For partial occupations or calendars, use the corresponding phase and window constraints. A different allowed order or calendar can change the controlling sequence.
To assess a proposed postponement, hold the stated commitments fixed, delay that start, and refit the affected work. Identify the latest feasible placement or the set of feasible start windows that still meets the protected event. Calendar gaps can make intermediate start times infeasible even when a later window exists. A backward arithmetic pass that ignores those gaps supplies no usable postponement permission.
Call a sequence critical for a stated plan, resource order and target event. Test a claimed critical operation by varying its duration or availability and recalculating that event. A throughput bottleneck limits sustained flow under a workload. A different condition can govern the first result by a deadline. Use OPS.9 to diagnose the constraint on the result in question.
OPS.10.2:4.5 - Choose early work, deferred starts and protection
Compare start policies inside the feasible windows. Starting earlier can reveal problems and retain recovery time. Deferring can avoid aging, premature expenditure or work invalidated by a later input. Retain the recipient’s original waiting boundary in either comparison.
When protection is needed, name the event and disturbance to be absorbed. Choose an internal target earlier than the commitment, or reserve time before a consequential join. Determine its amount from the delay scenario, supported bound or risk model that matters to the decision. A final margin is available time; calling it a buffer adds a policy for preserving and using it.
When several operations protect the same delivery, compare keeping their individual protection with placing protection before the common delivery or a feeding join. Revise the operation estimates and protection together, preserving the required work, intermediate obligations and execution conditions. Size the shared protection for the joint delays it must absorb: delays that can occur together cannot be treated as mutually exclusive. Check the new plan and the participants’ release and handover rules; moving reserve into one place does not make it available before every earlier commitment. Keep or restore local protection where the joint arrangement cannot protect that earlier result.
For known deterministic conditions, the feasible schedule can be enough. To protect against a stated extra hour of review, add that hour to the appropriate operation and recompute the plan. This answers the scenario without inventing its probability. A service-probability claim needs the corresponding duration and dependence model; OPS.10.1 supplies that construction.
After inserting protection, recheck resource and calendar feasibility. Moving a feeding operation earlier can take another task’s reservation. Keeping two hours before final delivery does not make those hours usable before an earlier calendar closure. Do not allocate the same margin to several independent promises without checking their combined delay.
Return the selected target times, reserved intervals and response to reserve consumption to OPS.8 for release and protection. OPS.7 uses the delivery consequences for priorities; use OPS.14 when the start policy or its economic justification depends on a financial comparison.
OPS.10.2:4.6 - Reconstruct the affected remainder after a change
At the current time, retain actual starts, completions and ongoing occupations. Replace the changed duration, readiness, access window, required operation or commitment. Do not restart completed work or shorten an uninterrupted operation merely to recover the former finish date.
Follow the changed operation through both its successors and the resources it shares. A task outside its precedence descendants can still lose a resource window. Include resulting admission changes and downstream joins; widen the affected set until its remaining boundary conditions are unchanged.
Try retaining unaffected reservations and the useful parts of the former plan. Refit the affected work under those commitments. If that restricted repair fails, identify which still-changeable reservation or resource order could matter and compare a broader rearrangement with its coordination cost. Failure while preserving the old order excludes only that restricted repair.
Recompute completion times, feasible postponement windows and protected reserve. Compare them with the same recipient events and deadlines. Report what that comparison establishes, such as a changed start or allocation, reserve consumed, an obtainable operating remedy, a commitment needing reconsideration, or an unresolved scheduling choice. Retain unaffected model and calculation results whose premises still hold.
OPS.10.2:5 - Archetypal Grounding
OPS.10.2:5.1 - A deliverable with a join and shared deadline margin
A report needs preparation P, taking four hours, and evidence extraction E, taking two. Different people can perform them concurrently from time zero. Review V takes three hours after both finish; release R takes one hour after review. These resources are independently available, durations are known, and release completes delivery. The deadline is hour ten.
| Operation | Predecessors | Earliest interval | Latest start for delivery at 10 | Total float |
|---|---|---|---|---|
| P | None | 0-4 | 2 | 2 |
| E | None | 0-2 | 4 | 4 |
| V | P and E | 4-7 | 6 | 2 |
| R | V | 7-8 | 9 | 2 |
The precedence path P-V-R takes eight hours and controls earliest delivery. E has two hours of free float before its delay moves V’s early start. Starting E at hour two preserves delivery at eight and may avoid producing an input earlier than useful. Starting it at four instead gives V at 6-9 and R at 9-10, consuming all final margin.
P, V and R each have two hours of total float against ten, but they share those hours. Delaying P by two moves V to six and R to nine; another two-hour delay of V would miss the deadline.
To preserve one hour before the external deadline, use an internal delivery target of nine. The latest starts become P at one, E at three, V at five and R at eight. They jointly give one feasible deferred plan with the intended final reserve.
Return to execution of the earliest-start plan. At hour two, preparation is found to need three further hours instead of two. E is already complete. Continue P to five, then V at 5-8 and R at 8-9. The new final margin is one hour. The changed estimate requires replanning the remaining preparation and its successors; E’s completed result remains available.
OPS.10.2:5.2 - A failed short-task priority is not an impossible deadline
Two jobs are ready at zero. U needs three hours of one specialist followed by seven hours of unattended equipment work. V needs two hours of that specialist followed by one unattended hour. The equipment is different for the two jobs, all resources are continuously available, and both results are required by hour ten.
Doing the shorter specialist task first gives V at 0-2, its equipment at 2-3, U at 2-5 and its equipment at 5-12. That plan misses the deadline.
Doing U first gives specialist intervals U at 0-3 and V at 3-5. U’s equipment runs at 3-10 and V’s at 5-6. Both dates are met. U’s own required chain takes ten hours, so the plan also attains the lower bound for the last completion.
In the first plan, the chosen resource relation V-before-U makes V part of the sequence controlling the final finish. In the second plan, V can finish well before U. That criticality was a consequence of the selected order. Five hours of specialist demand alone revealed neither the successful order nor the ten-hour completion.
OPS.10.2:5.3 - Shared attendance still permits machine overlap
Five orders arrive at zero. Each needs A for two hours and then B for three, with order 1-5 on each station. Each station has one continuously available machine; there are no setups, returns or other work. B completion makes an order ready for its customer. No operation is interrupted. Admit the first two at zero and the next order immediately when a B completion frees one of the two places.
With independent station resources, earliest A intervals are 0-2, 2-4, 5-7, 8-10 and 11-13. B finishes at 5, 8, 11, 14 and 17.
Now both stations use one operator. A requires continuous attendance; B requires attendance only in its first hour and holds its machine for all three hours. The old A intervals conflict with B attendance. Recovering the phases yields this revised plan:
| Order | Admission | A with operator | B with operator | B unattended | Completion |
|---|---|---|---|---|---|
| 1 | 0 | 0-2 | 2-3 | 3-5 | 5 |
| 2 | 0 | 3-5 | 5-6 | 6-8 | 8 |
| 3 | 5 | 6-8 | 8-9 | 9-11 | 11 |
| 4 | 8 | 9-11 | 11-12 | 12-14 | 14 |
| 5 | 11 | 12-14 | 14-15 | 15-17 | 17 |
At hour two, start B1 before A2; then place A2 inside B1’s unattended phase. Repeating that choice keeps B working continuously. The operator’s intervals do not overlap, and no more than two orders are admitted and unfinished.
B cannot begin before hour two and must process five orders sequentially for three hours each. Every completion therefore satisfies f_Bi >= 2+3i; the plan attains all five bounds. The shared operator changes starts at A without delaying any recipient result.
Customer times average eleven hours. Internal times are 5, 8, 6, 6 and 6 hours, averaging 6.2; the remaining average 4.8 hours occurs before admission. These quantities retain their different event boundaries.
OPS.10.2:5.4 - A calendar gap makes final margin unusable for a test
A maintenance test becomes ready at hour two. It needs a rig and an engineer together for three uninterrupted hours. A separate analyst then needs one hour to issue the acceptance result and is available throughout. The rig is available from two to ten; the engineer from zero to five and from six to ten. Acceptance is due at eight.
The test fits at 2-5 and acceptance work at 5-6. The final margin is two hours, but the test cannot be postponed by one hour: 3-6 crosses the engineer’s absence. The next complete test window starts at six, giving acceptance at ten. Within the original deadline, the margin can postpone the analyst’s work, not the test.
Before execution, the engineer’s first window is shortened to end at four. Common availability before the latest possible test finish at seven is 2-4 and 6-7: three hours in total, but no continuous three-hour interval. This excludes acceptance by eight. The earliest remaining test is 6-9 followed by acceptance at 9-10.
The obstruction identifies a useful remedy to investigate: restore attendance through five or obtain another qualified continuous window ending by seven. Merely reporting three available engineer-hours, or silently allowing the test to pause, does not answer the stated operation.
OPS.10.2:6 - Bias-Annotation
Finite deterministic schedules favor work whose remaining operations and durations can be specified. Discovery work or frequent unplanned returns can require scenarios, rolling revision or a different service model. Keep that uncertainty visible without withholding a useful known-date bound.
The examples assume that named people and machines are interchangeable only where stated. Human fatigue, location, recovery and skill conditions can change available occupation. Recover them when they alter the proposed plan and check that the reserved participant or resource can perform the work.
OPS.10.2:7 - Conformance Checklist
- The completion event, waiting origin, deadlines and any optimization preference are explicit.
- Required operations, precedence and partial resource occupations describe the work being planned.
- Resource sharing, capability, calendars and interruption conditions are jointly respected.
- A claimed feasible result includes an executable assignment of the required work.
- An impossibility or optimality conclusion has the necessary bound or complete-search basis.
- Float, feasible postponement windows and final margin retain their target and resource-order conditions.
- Protection has a named event, burden and delay basis, and the protected plan remains feasible.
- Revision follows shared-resource competition as well as precedence and preserves completed facts.
OPS.10.2:8 - Common Anti-Patterns and How to Avoid Them
| Mistake | Consequence | Repair |
|---|---|---|
| Schedule each department’s copy of one person independently | The plan double-books the actual person. | Constrain that person’s combined occupied intervals. |
| Keep the first priority rule after it misses a date | A poor sequence is presented as an impossible commitment. | Reconsider permitted orders or obtain an impossibility argument. |
| Spend each task’s float independently | Several tasks consume the same delivery margin. | Recompute their joint postponement. |
| Treat the original critical sequence as permanent | New resource competition or delay is missed. | Recalculate conditional criticality from the changed arrangement. |
| Deduct closed hours while allowing a continuous task to span them | A nominal working-time calculation produces an impossible operation. | Place the complete required occupation in a permitted window. |
| Add a buffer without rescheduling its feeders | Earlier work competes with existing reservations. | Check the full protected assignment. |
OPS.10.2:9 - Consequences
The planner can give the recipient a feasible schedule, the condition that excludes the deadline or the scheduling question still open. Conditional reserve also gives release and priority decisions something concrete to use.
Detailed scheduling costs inquiry and maintenance, and optimization may consume more effort than its possible benefit. A feasible plan remains dependent on the supplied work and access conditions. Reusing unaffected assignments and reopening consequential changes limits that burden without treating the first plan as permanent.
OPS.10.2:10 - Architectural Rationale
Precedence, resource competition and calendars enter together because each can exclude a superficially plausible plan. The precedence-only calculation remains a useful reduced case and lower bound when resources are relaxed. It becomes the full answer only when the omitted conditions do not invalidate its assignment.
Before relying on a time reserve, check that the schedule containing it meets the protected requirement. Reserve is then interpreted against a specific event and selected choices, allowing early and deferred policies to be compared.
The operating construction supplies phase occupations, appointments, available windows, receiving deadlines and the changed remainder. MMP.10 and CMP provide general formulation and search. Keeping criticality conditional also lets a planner revise a local sequence without mistaking it for the sustained-flow constraint of the whole service.
OPS.10.2:11 - SoTA-Echoing
For the question “Can this finite work meet its dates with shared resources?”, adopt explicit interval feasibility and sequence choices. The OR-Tools Job Shop account, variables and constraints supplies precedence and exclusive-resource alternatives; its CP-SAT result definitions distinguish a feasible answer, a proven optimum, proven infeasibility and an unresolved stop. Adapt these constructions in :4.2-4.3 to operating attendance phases and recipient deadlines. A precedence-only forward pass is cheaper and sufficient when resources do not bind. In :5.2 it cannot choose the specialist order, so explicit resource choices earn their added effort. Reconsider the formulation or search method when problem size or new operating constraints make its cost or representation inadequate.
For calendar feasibility, adopt the explicit distinction between elapsed interval and working duration in IBM’s Scheduling Tutorial, chapter 4. Its example permits suspension during days off and explains separate restrictions on starts, ends and occupied extent. Adapt :4.2 and :4.4 to choose the rule from the operation: :5.4 requires a whole uninterrupted occupation. Combining open hours would answer a different permitted-work question. The extra interval check is small and decides the example. Establish whether this test may pause from its operating conditions. Reopen when interruption, attendance or calendar rules change.
Goldratt, Critical Chain (1997), chapters 16–17, is a historical construction of moving protection from individual task estimates to project and feeding buffers, together with changed execution rules. Adopt the distinction between work estimates and deliberately placed protection in :4.1 and :4.5. Its halving example assumes already protected estimates; it does not establish a universal conversion of a task quotation into a duration or a completion probability.
For a known schedule or a named delay scenario, compare an explicit feasible plan with tested reserve against fixed critical-chain and percentage-buffer prescriptions. Herroelen and Leus, On the Merits and Pitfalls of Critical Chain Scheduling, PMI conference paper (2000), sections on critical sequences, buffers and computational experiments, supplies historical counterexample and experimental evidence. Adapt its attention to resource-dependent sequences and schedule revision; reject treating an initially selected chain or a fixed percentage as sufficient protection. This changes :4.4-4.6: preserve useful reservations, compare the delay actually being protected, and recheck resource feasibility after buffer placement. The cost is a more explicit comparison and possible coordination changes. The paper’s old software comparisons and experimental percentages are not present-day performance claims. Reopen when an applicable protection policy meets the same delivery and coordination requirements with better supported burden or outcomes; probabilistic protection requires its own uncertainty basis.
OPS.10.2:12 - Relations
OPS.10 selects the deadline or service question. OPS.10.1 constructs the capacity, mean or probability account when that question requires it. OPS.11.1 supplies the operating arrangement and resource identities; OPS.15.1 supplies event-defined time and occupancy quantities.
OPS.7 uses changed delivery consequences for priorities and commitments. OPS.8 uses feasible release times and protection; OPS.9 diagnoses what limits the stated result, including throughput or completion by a particular deadline. OPS.14 contributes financial consequences when the timing decision or the grounds for it depend on those financial consequences.
MMP.10 supplies the constraint formulation and its interpretation. CMP.4 supplies search with justified exclusions and CMP.5 supplies relaxation and bound reasoning when needed. C.29 returns the calculated schedule to its operating meaning; B.5.MPC coordinates changed subject premises, mathematics and computation. A.22.CGUS helps recover enabled alternatives before a sequence is fixed.
OPS.10.2:End
OPS.11 - Coordinate Interacting Operating Structures
Status: Stable
OPS.11:0 - Use This When
Use this Method when a proposed operating change depends on or affects another arrangement: material processing and order transactions, test work and release evidence, resource access and service commitments, or observation and supervisory decisions. Typical symptoms are a feasible local plan that cannot be completed in practice, a faster resource followed by more waiting elsewhere, or incompatible decisions by people responsible for different parts of the operation.
The first result identifies the couplings needed for the operating question, the feasible alternatives and their consequences, any decisions needed from other holders, and what would call for reconsideration. It can be a supported decision to keep the present arrangement, a coordinated change, a proposal or a precise missing input. Start from the operating question or proposed change.
Use OPS.8 for a queue-policy question that does not require wider coordination, OPS.9 for an unresolved constraint diagnosis, and OPS.10 for a capacity/service calculation. Product or organization redesign belongs to the corresponding engineering practice when that is the object being changed.
OPS.11:1 - Problem frame
An operation depends on several actual structures. Its resource participation, material transformation, case and commitment relations, information production/use, financial settlement and decisions may be described in different views. Those structures overlap through particular subjects and relations; the views need not be isomorphic.
Coordinate the change across the selected operating structures. Use their descriptions to trace the actual relations and establish who can decide each part.
OPS.11:2 - Problem
A local plan can omit a necessary coupling. Product is made but goods cannot be issued without documents. Tests complete but the evidence does not apply to the release configuration. Capacity exists but access is not granted in the required window. A resource-saving change transfers cost, risk or burden to another participant.
Start with the smallest set of actual couplings that can affect the proposed action or the grounds for relying on it. An extensive network description can add work without improving either answer.
OPS.11:3 - Forces
| Force | Practical tension |
|---|---|
| local clarity and cross-structure effects | A narrow view makes one decision easy while hiding a prerequisite or consequence elsewhere. |
| end-to-end coordination and independent authority | The result depends on several decisions, but their authority does not merge. |
| unlike quantities and comparison | Material, time, money, risk and human burden can all matter without having one valid scalar measure. |
| model detail and useful action | More represented relations can increase effort without improving the current choice. |
| stable agreements and changing conditions | A coordinated plan can become infeasible after access, evidence, demand or commitment changes. |
OPS.11:4 - Solution
OPS.11:4.1 - Start from the proposed operating change
Name the operating result, current arrangement, proposed change and horizon. State which consequence would make the change useful or unacceptable. Reuse the current OPS.1–OPS.4 account and a matching OPS.8–OPS.10 result where available.
Select affected Systems and participants by the consequences of the change. A supplier, customer, operator or neighboring service can matter without appearing inside the local department boundary.
If one direct pattern already settles the decision and its conclusion and conditions do not depend on any further cross-structure relation, use that result and stop.
OPS.11:4.2 - Identify the structures needed for this question
For each selected structure, recover the actual constituents, obtaining relations, applied constraints and use. Say what the current view shows and which material features it omits.
Use A.22 for the general structural question. Use E.18 for one transformation-flow structure and E.18.2 for a mathematical description when that lens is useful. Select an E.18.NET network only when at least two transformation-flow structures are independently identified and obtaining cross-flow relations connect their positions under the applicable constraints and use frame.
A branching process, several views of one flow, and several independently identified flows are different cases. Financial or decision relations need not be reclassified as a transformation flow to be relevant. If a required relation or identity cannot be recovered, retain the proposed description and name the missing basis.
OPS.11:4.3 - Recover the couplings that matter to the decision
For each coupling, state what depends on what, through which relation, under what condition and timing. Keep subject correspondence separate from production, supply, permission, evidence support, commitment or causal influence.
A useful working statement is: “This shipment can use this product only after these required documents are available”; “this test result applies to this configuration”; or “this provider grant permits this resource use during this interval.” Name the basis on which the receiving work can rely. Where a decision is required, identify its holder.
Distinguish an unsupported relation from evidence that it does not hold. For an action requiring permission, check any applicable authorization already in force. If permission remains unestablished, hold the dependent action and state what is known: the request may be unmade, pending or refused. A positive relation claim also needs the endpoints, scope and timing its use depends on.
Follow only the couplings that can affect the current decision or the conditions that justify it. If another step is unaffected, leave its details with its own account rather than reconstructing it here.
OPS.11:4.4 - Compare coordinated alternatives
Trace the finite change through the selected couplings. Compare the current arrangement with feasible alternatives, preserving the operating-result unit, horizon, acceptance conditions and protected consequences.
Include resource demand, service effects, financial timing, recovery, human burden and other consequences when they can affect the choice or its justification. Use applicable financial results or obtain the particular quantity and assumptions needed; a generic “value” label cannot stand in for cash, cost, obligation or benefit. Do not add unlike quantities into one score without an applicable comparison rule.
Check that the proposed decisions can coexist. A new release limit can overload a shared acceptance activity; a batch change can delay the information needed for another decision; an earlier delivery can require funding or access that has not been supplied. Use OPS.10 for the relevant load/service question and OPS.9 when the claimed limiting mechanism is still uncertain.
When the operating model itself needs to be built or reconciled, use OPS.11.1 to connect activities, shared resources, branch joins and completion at the required scales. Reuse an adequate model when the needed couplings are already represented.
Keep modeling assumptions and evidence limits visible. A simulation estimates a consequence for one arrangement or compares several under its assumptions. To rely on the result in operation, establish the relevant correspondence of relations and effects.
OPS.11:4.5 - Obtain or return the coordinated decisions
Name which operating policies can change within existing authority, which decisions must be obtained from other holders, and what remains held until an unresolved result is supplied. Distinguish an agreed coordinated plan, a proposed plan awaiting decisions, and the observed implementation.
Return the smallest actionable account: the supported disposition or remaining alternatives, operative couplings, affected decision-makers, conditions and sequence needed for compatibility, protected consequences, unresolved inputs and next review. Use the existing operating account where it can carry that meaning.
A coordination result can be a partial agreement plus an exact missing return.
OPS.11:4.6 - Observe the consequences and reopen the affected part
After authorized implementation, inspect the accepted result and the affected coupling assumptions. Reopen the relevant decision when a provider changes access, evidence applies to another configuration, an acceptance condition changes, a resource becomes unavailable or an affected party’s commitment changes.
When observation, actuation, supervision or feedback bears on the operating choice or its grounds, recover those relations and their delays through the current FPF control and temporal patterns.
An organization-design, capability-realization or product/service-engineering change returns to its owning practice. Keep a bounded operating adjustment local when that larger change is not needed.
OPS.11:5 - Archetypal Grounding
OPS.11:5.1 - PumpWorks: a rig plan is not a release decision
PumpWorks continues weekly evidenced controller releases while incident I73, release candidate R42, safety question S19 and provider change P8 coexist. In this constructed use, the four ready test packages carry eight rig-hours of estimated load. The current capacity comparison names actual usable rig windows rather than the number of board cards.
The question is whether a changed readiness and rig-access plan can support the release work without losing another necessary condition.
| Selected structure or relation set | Concrete coupling needed for the decision | Receiving action |
|---|---|---|
| rig-use arrangement | provider access, qualified operator and configuration jointly permit the specified test during the booked window | choose only feasible slots and return changed access to OPS.10 |
| test-evidence relations | T9’s result must concern the configuration used for R42’s release decision | preserve configuration/result correspondence; a result for another version does not close the evidence gap |
| release-supervision relations | ReleaseSupervisorTeam-S2 uses the required evidence and safety result to issue its authorized release, hold or other decision | obtain that decision separately from completing the test |
| existing service commitments | the evidenced-release horizon has parties, conditions and authority for revision | return changed feasibility to OPS.7 and the commitment holder |
Suppose lab-test permission is current and S19 concerns field release. Under that permission and once the needed provider access is in force, the responsible operator may run T9. Field release remains held pending S19 and the release decision. Request provider access if it is missing. If S19 also governs the lab test, that test lacks a sufficient permission basis and remains held too.
OPS.8 maintains the ready queue and keeps incomplete matters visible. OPS.9 distinguishes readiness loss from an unsupported rig-bottleneck claim. OPS.10 compares the usable windows with eligible load and recovery scenarios. Use OPS.11 to return the compatible decisions and identify any missing safety or provider result for the responsible holder.
If P8 reduces available rig time, reopen the capacity and dependent admission/release-policy decisions. Do not reinterpret a completed test as approval to bypass S19 or as evidence that the weekly service commitment has been fulfilled.
The selected permission, evidence, supervision and commitment relations are sufficient for the stated coordination question.
OPS.11:5.2 - Chemical make-to-order: material completion and document work
In a chemical make-to-order setting, goods issue depends on both available product and required commercial documents. The same order-processing resource can be needed for new-order transactions and invoicing. A material-only plan can therefore produce stock that cannot be shipped under the actual transaction conditions.
The first coordination result names that shared-resource and shipment-prerequisite coupling, then compares a compatible transaction/release policy with the local manufacturing plan. Actual commercial rules, financial consequences and authorization remain supplied inputs. The Perez et al. (2023) model compares this coupling under specified conditions. A claim about improvement at a particular plant needs evidence of its operation.
OPS.11:5.3 - AI-assisted operation: generation, acceptance and deployment
An AI-assisted software operation can generate candidate changes faster while human acceptance, test environments or deployment permissions remain unchanged. Candidate changes, tool calls, episodes, evidence and accepted releases have different identities and resource demands.
The practitioner follows only the relevant couplings: which configuration a test supports, who can accept the change, which provider/tool access is available, and what deployment conditions apply. A useful result might reduce admissions to the acceptance capacity, reserve a compatible test environment and return an unresolved release decision. Agent capability and software assurance require evidence about the work performed and the configuration assessed.
OPS.11:6 - Bias-Annotation
| Bias | Consequence | Countermeasure |
|---|---|---|
| diagram realism | A represented connection is treated as an obtaining relation. | Recover participants, relation basis, constraints and use. |
| one-flow reduction | Money, decisions, materials and evidence are merged because all are drawn as arrows. | State each relation and quantity under its own meaning. |
| department-boundary bias | A provider, customer or neighboring service consequence is omitted. | Select affected participants by the operating consequence. |
| local optimum confidence | A feasible local plan is treated as a feasible end-to-end plan. | Trace the necessary cross-structure conditions and shared resources. |
| authority aggregation | One coordinator appears able to grant every participating decision. | Use decisions already in force. Refer a decision still needed to its authority holder. |
OPS.11:7 - Conformance Checklist
- Is one operating change or conflict and its intended result clear?
- Are the selected actual structures distinguished from their views and mathematical descriptions?
- Does each consequential coupling have recoverable participants, relation, conditions, timing and basis?
- Are incompatible units and protected consequences retained in the comparison?
- Can the proposed decisions coexist under the actual resource, evidence and authority conditions?
- Does the result distinguish agreed change, proposed change, missing return and implementation evidence?
- Is it clear when a decision or its qualification needs reconsideration?
Recognition means a practitioner can produce this bounded coordination result. Assurance requires the obtaining relations, qualified consequences and authority on which the chosen action relies; a complete map supplies none of them by itself.
OPS.11:8 - Common Anti-Patterns and How to Avoid Them
| Anti-pattern | Failure | Repair |
|---|---|---|
| Call every connected diagram a flow network. | Different structures and descriptions are collapsed. | Apply A.22/E.18/E.18.NET only to the object that meets the corresponding conditions. |
| Optimize material production while ignoring transaction prerequisites. | Product can accumulate without an admissible shipment. | Recover the actual goods-issue and shared-resource coupling. |
| Use evidence from the wrong configuration. | A completed test does not support the current release claim. | Bind the result to the exact subject and conditions. |
| Turn missing information into a negative world claim. | Lack of evidence is mistaken for evidence of absence. | Return the exact unresolved basis and its consequence for use. |
| Treat a coordinated diagram as permission. | The relevant decision-maker may not have authorized the action. | Establish whether a valid decision already covers the action. If permission is still needed, obtain it from the holder or report the gap. |
| Build an exhaustive enterprise map when a smaller account already settles the question. | Unneeded modeling work delays the useful result. | Select only relations that can affect the choice or the grounds for relying on it. |
OPS.11:9 - Consequences
The operation can coordinate a change without making local gains invisible to affected participants. A small coupling account can prevent incompatible schedules, unsupported release claims and displaced costs.
The cost is recovering the relations and obtaining any outstanding decisions across boundaries. Some outcomes remain partial because another practice owns a necessary result. That partial result is useful when it identifies the exact next decision and preserves what can already proceed.
OPS.11:10 - Rationale
Cross-structure coordination is needed because one operating result can depend on relations that no single view preserves. Trace the couplings needed to decide whether a concrete action and its conditions are supported.
Retaining different relation meanings also preserves responsibility. A financial consequence, a safety permission and a causal explanation can all constrain the same plan while requiring different evidence and different decisions.
OPS.11:11 - SoTA-Echoing
| Practice question and selected line | Serious alternative, trade-off and pattern change | Source roles, limits and reopen condition |
|---|---|---|
| How can a locally feasible plan fail at completion? Adapt coordination of actual material, transaction and shared-resource prerequisites. | A material-only or transaction-only plan is cheaper but can omit a condition that makes its result unusable. Sections 4.3–4.5 and 5.2 retain the coupling and compare only the detail needed for the decision. | Perez et al. (2023) supplies a coupled-scheduling candidate and modeled failure evidence. The modeled results depend on the chemical supply chain, business rules and objective studied. Reopen when the business rule, shared resource or material/transaction coupling changes. |
| How much cross-structure representation is useful? Adapt a question-relative selection of obtaining relations at the relevant scales. | One universal flow diagram loses relation meaning; an exhaustive enterprise map costs more than some local decisions warrant. Sections 4.1–4.3 and 5.1 use a small actual-coupling account and keep descriptions separate. | Wassick and Perez (2025), §§3.2–3.5, supplies the current network-of-networks perspective. A.22 and E.18.NET supply the exact structural distinction. The perspective does not establish realized autonomous coordination for a particular operation. Reopen for a missing decision-changing structure or a simpler adequate representation. |
| Can faster software generation be treated as faster service? Adopt subject-correct coupling of generation, evidence, acceptance and permission. | Counting episodes or artifacts is cheaper but can omit acceptance capacity and deployment conditions. Section 5.3 retains the accepted-result boundary while 4.4 traces resource and permission consequences. | The existing Operations subject/current-account Methods and current FPF evidence and relation patterns supply the governing distinctions. They do not establish model capability, software assurance or field performance. Reopen when the actual acceptance path, provider constraint or evidence binding changes. |
OPS.11:12 - Relations
OPS.1–OPS.4 supply the operating focus, relevant views, subject distinctions and qualified current claims. OPS.8–OPS.10 supply queue, diagnostic and capacity results that can require coordination. OPS.5–OPS.7 consume the resulting conditions within their own admission, continuation, priority and commitment questions.
Current FPF A.22, E.18, E.18.2 and E.18.NET govern selected structures and their descriptions; A.6.REL governs direct relation questions. C.11.CRC and C.11 govern finite comparison and choice. B.2.5 and the current control/temporal patterns apply when actual supervision, feedback and response timing affect the choice.
Organization Change Engineering supplies a relevant organization or coexistence Method only at its current scope; a case-specific result still has to exist. Engineering, clinical, safety, labor, legal, financial and other practices retain their direct decisions. OPS.12–OPS.18 provide their own human-condition, service, financial, account, Method-improvement, repertoire and quality Methods. OPS.19 consumes an OPS.11 coupling result only when several otherwise valid operating results conflict across subjects, scales, or horizons. OPS.16 local Method improvement and OPS.20 cultural continuation remain separate questions with their own evidence and authority.
OPS.11:End
OPS.11.1 - Construct and Reconcile Operating Models Across Scales
Type: Method pattern Status: Stable Normativity: Normative
OPS.11.1:1 - Problem frame
Use this when the operation needs a way to obtain a required result, or an operating change looks useful in one account of the work but its consequence cannot be recovered in another. A department appears to have spare capacity while the person doing its work is already occupied elsewhere. A laboratory reports completed samples while the customer needs a complete order. A team can describe individual tasks but cannot explain what controls delivery by the wider service.
Use an adequate existing arrangement and its model, or construct the missing arrangement or description. Connect the local and wider accounts needed for the question. Here a model is a description used to obtain an answer about the operation. A drawing, a set of conditions, a calculation or a simulation can serve that use. Keep the description distinct from the actual work and its arrangement.
First useful move. Choose one recipient’s result and the current difficulty in obtaining it. Recover an available way of doing the necessary work, or identify the missing professional contribution. Follow a present or proposed case through its resources and completion conditions, or recover what maintains the required service over its interval. Where two descriptions refer to the same worker, order or event, bring those references together before calculating.
Practical gain. The practitioner can compare feasible arrangements without mistaking local capacity for available shared capacity or local completion for delivery. The result may also identify the particular coupling that makes a proposed change fail.
The reader needs a usable account of the participants and events. They may identify them directly, use a qualified result, or obtain the missing information from a provider familiar with the work. The elementary cases below need arithmetic and time intervals. A more demanding calculation can be obtained from a modeling specialist.
Use an adequate existing operating model directly when its assumptions and retained detail answer the present question. A staffing total alone may settle a proposed start. This method is useful when choosing or reconciling the model can affect the answer or establish the grounds for it.
OPS.11.1:2 - Problem
Descriptions at different scopes can each look reasonable while making incompatible assumptions about the same operation. A resource appears once in each departmental plan and is then treated as two resources. An internal exit becomes the completion event of an external service, although acceptance still takes time. Several samples are aggregated to one order without retaining which sample prevents delivery.
A desired service can also lack an adequate operating arrangement. A deadline names the result but leaves open how work should be divided, prepared and provided. Comparing only schedules for the existing route can miss a useful change to that route; drawing a different route can hide the technical method or provision that it still needs.
Adding detail everywhere makes the account harder to build, interpret and maintain. Keeping only totals can erase the dependence that matters. The practitioner needs a way to construct an attainable arrangement and retain its consequential dependencies while leaving irrelevant detail out.
OPS.11.1:3 - Forces
| Force | Tension |
|---|---|
| Required result and available way | A desired service can motivate another arrangement, but a drawn operation supplies neither a qualified method nor its provision. |
| Local understanding and shared operation | Local accounts can represent the same resource or receiving condition under different names. |
| Compactness and useful distinction | An aggregate is easy to use until two cases with the same aggregate require different decisions. |
| Stable account and changing policy | A useful service approximation can cease to apply after routing, release or staffing changes. |
| Several working questions | An order deadline, machine load and cash receipt concern related but different subjects and events. |
| Timely decision and additional inquiry | An unresolved premise can matter, but obtaining more detail costs time and may leave the decision unchanged. |
OPS.11.1:4 - Solution
Specify the needed outside result, recover the work that obtains or maintains it, reconcile shared participants, and connect the quantities and events at each useful scale. Refine an account when an omitted distinction can affect the answer or its grounds. Return the resulting comparison with the conditions on which it depends.
OPS.11.1:4.1 - Fix the receiving result and the proposed change
State what the recipient must obtain and which event or continuing condition makes it available. For an order, this may require accepted components, transport and permission to use the result. For a machine service, it may be restored operation. An incident service can instead require qualified response to remain obtainable throughout a covered interval. Use the completion or service condition of the present or proposed operation and keep any proposed change to that condition explicit.
When comparing a change, name the alternative under consideration: another release time, a different allocation, a larger transfer batch, changed routing or another operating method. Identify the quantities that would make the alternative preferable and any conditions it must preserve. When no adequate arrangement has yet been proposed, construct alternatives through :4.2a from the result, available methods and missing contributions. OPS.1 supplies the operating focus and OPS.19 the wider reconciliation when several results govern the choice.
Retain the difference between a fixed input and a decision variable. If a contractor’s two-day turnaround is a commitment that cannot change, the present model can use it as an input. If the proposal changes how that contractor is used, recover the response to that change rather than assuming the same turnaround.
OPS.11.1:4.2 - Recover what obtains the result
For a case, follow its relevant arrival to its receiving completion. For a continuing service, identify the condition that must be maintained, the work that preserves it and the events that require a response. At each consequential action, identify the required input, what can happen next, the condition that enables it and what it produces. Include external work when the result depends on it, even if that work is absent from the organization chart.
Separate the route from the resources used along it. For each consequential operation, determine which resources it holds and for how long. A machine may hold a part throughout a cycle while needing an operator only for loading and unloading. A person may be shared between apparently separate stations. A pool may provide alternatives only when the members have the needed capability and access.
Recover joins and returns. Two component outputs may both be needed before acceptance; a correction may revisit a resource already assigned to new work. A release rule must then account for unfinished obligations as well as newly admitted cases.
Represent the relevant network of transformations and conditions. Distinguish an input or result passed to another operation, a resource used by several operations, and a condition that enables an operation. Label those relations in a diagram or state them in a table. An arrow without a stated meaning can hide whether a result is needed, a person is occupied or someone must authorize the action. A route may branch, join or return; it need not be one predetermined sequence.
Connect that network to the commitments and authority on which it relies. Identify who can request, promise, declare completion and accept the relevant result. Those acts can themselves take time and consume resources. Their organizational meaning and their resource demand answer different questions. Counting a person’s existing assignments establishes demand on that person; it does not establish or redesign the person’s authority.
Compare an alternative by stating what changes: a transformation, its required inputs or outputs, an enabling rule, resource occupancy, a commitment or an authority relation. Keep unchanged relations available for reuse. A changed release limit or route does not by itself establish a change to the organization’s roles. Conversely, leaving the boxes and job titles unchanged does not establish that people can exercise a newly assigned responsibility.
A.22.CGUS helps express available continuations and their conditions before fixing a sequence. OPS.8 supplies readiness and release policy. Use the existing description of those relations when it already conveys them; the work does not require a particular diagram.
OPS.11.1:4.2a - Construct alternatives when the arrangement is not given
Work back from the recipient’s required result to the contributions it needs. For each contribution, recover a qualified way of obtaining it, the input it requires, the result it supplies and the conditions under which the receiver can use it. Use the actual professional explanation or a competent provider’s result. Where no adequate way is available, return that method or research question through FPF C.39 and the relevant discipline. A box labeled with the desired outcome cannot yet support a resource estimate or a promise.
Start from the required contribution. If no suitable route exists, construct one from available professional methods, resources and receiving conditions. If a route exists, keep it as an alternative. Establish why a change is worth comparing: it may miss a requirement or meet it at a cost another arrangement could reduce. The following questions suggest ways to develop the comparison.
- What can be prepared before a particular request is known? Separate reusable preparation from work that depends on that request. Identify how long the prepared result remains usable, which later work consumes it and what can make it obsolete. Compare stock and preparation burden with the delay avoided after arrival.
- Where can a smaller contribution become useful? Choose work and transfer boundaries from readiness and receiving conditions. Compare smaller transfers with the setup, checking and coordination they add. Keep a required join even when its constituents travel separately.
- Which provision can change? Compare qualified alternative resources, routes or providers, including their setup, response, access and existing load. A shared preparation or support service can replace repeated work only when its result is usable in each receiving case.
- Where can the operation accommodate variation? Compare available capacity, suitable prepared inputs and permitted waiting for the same service question. Include the replenishment or recovery that makes the protection sustainable. Preserve the supplied limit when delay, storage or interruption is inadmissible.
Develop the alternative whose mechanism addresses the difficulty. In a familiar case, one changed allocation can suffice. When changes across methods, performers and means must be constructed together, FPF C.32.MWA.PP:4.3–4.7 supplies that comparison. This operating model then retains the particular unit, readiness, occupancy and timing relations needed to calculate its consequences.
Follow the proposed work forward. Show how each intermediate result becomes usable, how common preparation and recurring work are counted, where resources coincide or conflict, and how acceptance is reached or service is maintained. Count displaced work and the transition from the present arrangement. Sections :4.3–4.6 reconcile and compare these accounts. Reject a candidate that merely moves the missing contribution to another participant who cannot supply it.
Separate three possible returns. A rearrangement within established methods and authority can proceed to the operating choice. A changed reusable method needs the method comparison and evidence in OPS.16–OPS.17. Changed organizational contribution or authority relations need OCE.4, OCE.6 and their realization conditions. These contributions can cooperate, but the model keeps each proposed change conditional until its required result is available. When no feasible alternative remains, return the particular requirement or unavailable contribution to its decision maker; a more elaborate model need not be the next useful work.
OPS.11.1:4.3 - Reconcile shared participants and operating conditions
Compare the local accounts at their connections. Establish whether two resource names denote the same resource, interchangeable members of a pool, or different resources. Do the same for cases, batches, deliveries and completion events.
Apply the constraint once to the actual shared participant. If one operator serves two stations, both demands compete for that person’s available intervals. If one vehicle carries several orders together, those orders share the trip; their inclusion does not create several vehicle trips.
Compare calendars and eligibility. Six hours of available labor and six hours of eligible work can remain incompatible when they occur at different times or require different skills. Conversely, an unattended stage can permit another operation during part of the same elapsed interval.
Keep different receiving questions distinct. The project sponsor’s completed result, the performer’s completed assignment and the administrator’s settled expense can have different boundaries. Connect the relevant events instead of treating the shared word “completed” as an identity. OPS.3 supplies subject recovery; F.0.1 and F.9 help when local meanings or their correspondence remain unresolved.
OPS.11.1:4.4 - Connect the quantities and events across scales
Choose the relationship needed between the accounts. Sometimes a wider quantity is a sum of disjoint local quantities. Sometimes it is a union, a maximum, a rate over an interval or a conditional response. Derive that operation from the receiving question.
For example, an order requiring every component becomes ready at the latest required component completion, provided no further work remains. Adding component completion times would describe neither that event nor the elapsed time. Parts processed together in a feasible machine batch share its occupation; take the union of that machine’s occupied intervals when calculating its busy time.
When aggregating, preserve the condition under which the summary is usable. A department’s average service rate may help a sustained-load question but leave the deadline of a particular batch unresolved. A sample-count summary may omit which order is waiting for its final sample.
To construct a sufficient summary, first express the requested result in the quantities you propose to retain. Derive the answer from those quantities and their stated conditions. If an omitted detail still enters the answer, look for two allowed arrangements with the same summary and different answers. Such a pair disproves sufficiency; failing to find one does not establish it. Retain the distinguishing relation, derive a useful bound, or restrict the answer. In the laboratory case below, the sample-to-order relation and the latest required completion provide the order’s completion event; sample totals alone cannot. C.29.1 develops this construction and preservation question. MMP.18 constructs compatible exchanges when mathematical models must be coupled, including shared quantities, time scales, feedback and uncertainty.
OPS.11.1:4.5 - Refine the part on which the answer depends
Start from the smallest available account that addresses the question. Open a local part when a consequential result depends on its hidden timing, sharing, variation, return or completion condition.
A service block described by a fixed delay can be adequate for a question that leaves its load and resources unchanged. If the proposed release creates congestion inside that block, replace the fixed delay with the load-sensitive account needed for the comparison. Keep unaffected neighboring blocks at their sufficient level of detail.
Changing scope and changing detail are different moves. Adding a subcontractor widens the modeled operation. Showing the subcontractor’s internal batching adds detail. The first can be necessary while the second is irrelevant because the contract already supplies the required response.
Identify uncertainty separately from a deliberate simplification. “The loading time is unknown” calls for an estimate, range or observation if the answer depends on it. “We combine identical loading steps” is a modeling choice whose effect can be compared. C.11.DUA governs whether resolving an uncertainty is worth more than a restricted answer or a different action.
OPS.11.1:4.6 - Obtain and interpret the operating alternatives
Translate the recovered conditions into a form from which the requested result can be obtained. MMP.10 constructs constraints; OPS.10 selects the service and capacity question. Use a hand calculation when it suffices, or choose a computational procedure under C.29.2 and the relevant CMP methods.
Check the obtained alternative against the operating arrangement. Are the required performers, equipment and other resources available in the proposed intervals? Are the receiving inputs available together? Does the calculated completion make the result usable, or can the arrangement sustain the required service condition throughout its interval? A schedule can satisfy a mistaken model, so successful computation alone does not settle these questions.
For a comparison across scales, return the local change and its wider consequence together. Explain where a delay, burden or unfinished obligation moves. Use OPS.14 when financial consequences bear on the comparison or its grounds. Interpret each quantity for its period and use.
Stop with a sufficient comparison or the missing contribution that prevents one. Retain the assumptions a recipient needs to use the result. When routing, resources, calendars or acceptance changes, revise the affected account and propagate the change through the relationships that consumed it.
OPS.11.1:5 - Archetypal Grounding
OPS.11.1:5.1 - Two departments share one operator
Three units need preparation and then inspection. Each step takes two hours of one operator’s attention. Preparation and inspection are shown as separate departments, each with an eight-hour day. A departmental summary assigns six hours to each and appears to permit same-day completion.
Recovering the resource references shows that the same person performs both steps. The work needs twelve operator-hours. This excludes completion within eight hours under the stated arrangement, without needing a detailed simulation. Preparing and inspecting each unit in turn attains twelve hours if no other restrictions apply.
Now inspection changes: its first half-hour requires the operator, followed by one and a half hours of unattended machine operation. The operator demand becomes 7.5 hours, but that total alone does not prove an eight-hour schedule. With one inspection machine, a feasible sequence is:
| Unit | Preparation | Inspection with operator | Inspection unattended | Completion |
|---|---|---|---|---|
| 1 | 0–2 | 2–2.5 | 2.5–4 | 4 |
| 2 | 2.5–4.5 | 4.5–5 | 5–6.5 | 6.5 |
| 3 | 5–7 | 7–7.5 | 7.5–9 | 9 |
The machine’s final unattended interval extends beyond the operator’s work. Completion by hour eight is still impossible: preparing all three units and starting all three inspections needs 7.5 operator-hours, followed by the last inspection’s 1.5 unattended hours. The schedule attains that nine-hour bound. Separating resource occupancy from elapsed processing gives the next design question: what can shorten or overlap that final tail?
OPS.11.1:5.2 - Sample throughput does not determine order completion
A laboratory has one machine that processes up to two samples in a four-hour batch. Order U needs samples u1 and u2; both are ready at zero. Order V needs v1, ready at hour three. No other work remains after the required samples finish.
Starting U’s two samples at zero completes U at four. Processing V next completes V at eight. Waiting until hour three and batching u1 with v1 completes those samples at seven; u2 then completes at eleven. Both alternatives use two machine cycles and process three samples, yet the order completions differ: (4,8) versus (11,7).
For a promise U by five and V by nine, only the first alternative meets both. The model must retain the sample-to-order relation and the all-required completion condition. A total sample count cannot answer that promise. If partial results become useful to the customer, revise the receiving result rather than assuming the same all-required condition.
OPS.11.1:5.3 - An outside service can remain compact
A team must release a report by Friday. An external reviewer undertakes to return comments within one working day for the proposed submission class and volume. The team’s comparison changes its internal preparation sequence but leaves that submission within the commitment.
The model needs the external review step, its working calendar and the team’s response to comments. It can use the promised response as a conditional input without modeling the reviewer’s internal allocation. If the proposal instead triples submissions beyond the commitment, that input no longer answers the changed use. Return to the external capacity or commitment question before relying on the old delay.
OPS.11.1:5.4 - Change a report route while retaining its acceptance authority
A laboratory has promised an accepted report. Its operator produces an analysis record; a qualified reviewer examines that record and can require correction. Only the reviewer’s acceptance makes the report available for the promised use. The same person may hold both roles if the applicable rules allow it; their occupied intervals must then be reconciled as one person’s demand.
The solid arrows below pass named work products. The dotted links state conditions supplied by commitments, authority or resources; they do not pass the report or prescribe a sequence.
flowchart LR
S["Sample and required case data"] --> A["Analyze"]
A --> D["Analysis record"]
D --> R["Review"]
R --> P["Accepted report"]
R --> C["Correction request"]
C --> F["Correct the record"]
F --> D
K["Promised case and permitted start"] -. "enables" .-> A
L["Analyzer and eligible operator time"] -. "required during analysis" .-> A
V["Reviewer authority and available time"] -. "required for review and acceptance" .-> R
Suppose incomplete case data repeatedly occupy reviewer time. One proposal inserts an automated completeness check between the analysis record and review:
flowchart LR
D["Analysis record"] --> X["Check required fields"]
X --> Y["Record with required fields present"]
Y --> R["Review"]
X --> C["Missing-field report"]
C --> F["Complete the data"]
F --> X
R --> P["Accepted report"]
This second diagram shows only the changed route. The first diagram’s start conditions, review authority, substantive correction return and resource constraints still apply. The automated check establishes field presence, not correctness or acceptance. Add its computing demand and the operator’s completion work to the resource account; compare the saved review work with that added demand. The new route can be worse if it moves the bottleneck to a scarce operator. Use a simulation or trial when it could resolve a consequential uncertainty about the choice or its grounds at a justified cost.
These proposals change different things:
| Proposal | What changes and what must be obtained |
|---|---|
| Give an already qualified and authorized reviewer a different case or time slot. | Reconcile that person’s existing assignments and commitments through OPS.10–OPS.13 and OPS.19. The allocation need not change any authority relation. |
| Insert the completeness check under existing permission. | Compare the changed route and its resource consequences. OPS.16 can govern a useful trial; a locally usable operating arrangement can supply its conditions. |
| Let the operator accept reports without the previously required reviewer. | The proposed completion and authority relations change. Obtain the relevant professional acceptance decision and organization-design/assignment result before relying on the proposal. A faster route does not authorize it. |
| Introduce the route where staff cannot yet perform or sustain it. | Establish the needed capability, practice and support. Use the relevant development, Method-introduction or organization-change methods for that question; put their actual learning and support work into the same resource account. An unchanged organization chart does not supply those capabilities. |
The result is a comparison of identified changes and their consequences, with any missing decision left visible.
OPS.11.1:5.5 - Derive preparation and provision from a changed service requirement
Six orders for configured kits arrive together. The service must make all six kits available within two hours. One qualified technician and one workstation are available in that interval. The stipulated method needs, for each kit, 20 minutes of preparation usable for any order in the stated class and 10 minutes of case-specific finishing and acceptance. Both phases occupy the technician and workstation. There is no other work or transfer delay in this constructed comparison. Performing all six kits after arrival requires 180 minutes of each resource, exceeding the available 120.
The current method permits preparation before an order is known: each prepared item remains compatible with any kit in the stated class and usable for the whole day. Both the technician and workstation have an otherwise uncommitted two-hour window before order arrival. One candidate therefore prepares six items in that earlier window and performs the six ten-minute finishes after arrival. The last kit is accepted at minute 60. Total labor remains 180 minutes; the arrangement changes when the preparation is performed and what is held between performances. If fewer orders arrive, prepared items can remain unused, so inventory and obsolescence belong in the comparison. The two-hour service can be supported for this stipulated six-order case. If the workstation is unavailable in the earlier window, this candidate has no supported preparation slot; obtain another feasible slot or compare a different arrangement.
Now the product specification changes: preparation must use the actual ordered device’s serial-number data, which becomes available only on arrival. Preparation before the order is known is no longer usable. Keeping the previous stock does not remove the 180-minute post-arrival demand. Revise the service model because its preparation relation, work boundary and timing premise changed.
A second qualified technician with an independent workstation can provide a different arrangement, if both are actually available under the required authority. Each technician completes three thirty-minute kits; the last kits are accepted at minute 90. Compare the added provision and its displaced work with a later or smaller service offer. If the second provision is unavailable, retain the 180-minute bound for the existing arrangement and return the promise to its owner. Product engineering might supply a genuinely different preparation method, but that result must be obtained before counting its expected saving.
The unit design follows the same change. Initially an order-independent prepared item can exist before any customer case; after the change its preparation belongs to an identified order. OPS.3 preserves that correspondence, OPS.10 supplies the capacity and schedule, OPS.13 forms the possible service agreement and OPS.14 compares consequential payments and unused stock where those matter. Existing acceptance authority and the one-kit result can remain unchanged. Revise the affected capacity and delivery conclusions while keeping conditions that still hold.
OPS.11.1:5.6 - Model a continuing service when no case is completed
A facility buys readiness over a four-hour interval: a qualified responder must be able to begin an incident response within ten minutes of an incident’s arrival. The stipulated demand condition permits at most one active incident; the responder remains available for any response owed from that interval. Alerts arrive within one minute. The response method, access and equipment are already qualified.
One arrangement lets the responder perform a records audit while no incident is active. The audit can be left in a resumable state within one minute, and obtaining the response setup takes two more minutes. Even counting those delays consecutively, response can begin within four minutes. The operation can therefore obtain some audit work while preserving the stipulated readiness. A quiet four-hour interval with zero incident completions can still supply the purchased service.
Another proposal assigns the same person to a twelve-minute task that cannot be interrupted. An incident just after that task starts can leave almost fourteen minutes before response begins, including the two-minute setup. Low average incident demand does not make this arrangement satisfy the ten-minute condition. Move that task to other provision, change its interruption method if technically possible, or obtain a different service agreement. OPS.8.2 supplies the fuller release-and-restoration construction.
If demand changes to permit simultaneous incidents requiring separate responders, the single-responder premise fails even though the four-minute return remains attainable. Obtain the required qualified provision or revise the promise. The account keeps availability over an interval, work performed during quiet time and actual incident results distinct; a completed-case count alone cannot express all three.
OPS.11.1:6 - Bias-Annotation
Most examples favor discrete cases and identifiable completion events; :5.6 instead retains continuing availability. Continuous production can require amounts and rates. Choose the modeled subjects from the receiving result; a successful discrete-case model supplies no automatic transfer to every operation.
The method also favors consequential detail. That can miss an effect outside the initially named decision. When a participant identifies a plausible displaced burden or failure, include the affected relation before treating the local comparison as sufficient.
OPS.11.1:7 - Conformance Checklist
- The model answers a named operating question and uses the recipient’s completion or service condition.
- The arrangement uses sufficient professional contributions. For a proposed change, the affected dependency, preparation, recurring work and receiving connection are clear where they matter.
- Routes, resource occupancy, calendars and eligibility are distinguishable where they change feasibility.
- Shared participants remain shared across local accounts.
- Product dependencies, resource use, enabling conditions and authority relations retain their meanings; a proposed change identifies which of them changes.
- Each aggregate or cross-scale relationship has an operation and conditions appropriate to its receiving use.
- A refinement identifies a distinction on which the answer or its justification depends. Unaffected detail can remain compact.
- The returned result distinguishes the computed consequence from the assumptions about the operation that support it.
- A changed premise identifies the affected account and receiving consequences.
OPS.11.1:8 - Common Anti-Patterns and How to Avoid Them
| Observed or text-invited mistake | Consequence | Repair |
|---|---|---|
| Give each departmental box its own copy of a shared worker | Individually feasible plans compete for the same hours. | Reconcile resource references and impose the common occupancy constraint. |
| Sum or average local completions to obtain delivery | The result ignores joins and the final required contribution. | Derive the receiving completion event and its relation to local events. |
| Preserve a fixed service delay after changing its load | The comparison suppresses the congestion it may cause. | Reopen that service response under the proposed conditions. |
| Treat a changed route or a new assignment as proof of organizational redesign | Resource regulation becomes confused with changing who may promise or accept a result. | Compare the product, resource, commitment and authority relations separately, then obtain the result needed for each actual change. |
| Expand every box before comparing an alternative | Modeling consumes resources without improving the decision. | Refine the part whose omitted distinction affects the answer or the conditions that support it. |
OPS.11.1:9 - Consequences
The practitioner can construct an operating alternative as well as compare a supplied proposal. Local choices become comparable at the scope where their consequences matter. When a contribution is missing, the account identifies it, for example a qualified method, effective provision, occupancy interval, service response, completion relation or calculation.
The result remains conditional on the work description and model choices. A more detailed account can cost more without improving the decision; an omitted interaction can invalidate it. Keeping the relationships between accounts visible makes a later correction localizable.
OPS.11.1:10 - Architectural Rationale
Coordination uses several descriptions because the work supports several questions. Forcing them into a single hierarchy hides shared resources and cross-cutting relations. Leaving them disconnected permits incompatible assumptions. This method connects the quantities and participants needed for one operating decision while allowing the accounts to retain different purposes.
The outside result selects useful internal detail. The same principle also permits a return from an internal obstruction to a changed promise or wider arrangement. The direction is therefore iterative rather than a one-time decomposition.
The operating contribution is the construction of work boundaries, preparation and provision alternatives, routes, resource use, joins, calendars and completion relations. General mathematical coupling, constraint formulation and computation remain available through their own methods. Use those methods for the mathematical or computational contribution the operating question needs.
OPS.11.1:11 - SoTA-Echoing
To compare a change involving shared resources or several contributors to one result, choose the model’s scope and detail from the receiving question. Adopt that purpose-led selection from Robinson’s conceptual-modeling tutorial (2017), §§2–6, and adapt it to the route, resource and completion construction in :4.2–4.5. The selected answer retains the relations that determine the requested consequence and leaves the rest compact. Robinson supplies the distinction between scope, detail, assumptions and simplifications; the operating constructions here make that selection usable before deciding whether computer simulation is needed.
A serious default is to combine departmental capacity and output totals. In :5.1 those totals conceal competition for one person; in :5.2 total sample throughput does not determine either order’s completion. Recovering the shared resource and the sample-to-order join corrects those answers without describing every internal action. It costs an inquiry into the relevant identities and timing, but the first case can already be rejected by an arithmetic bound. Conversely, a detailed schedule of every supplier would add inquiry and maintenance without changing :5.3’s comparison: its conditional one-day commitment is sufficient. Sections :4.4–4.5 therefore construct or test a sufficient summary and refine only a consequential omission.
Hopp and Spearman, Factory Physics, third edition, supplies production reasoning about batches, capacity and variability for identifying these dependencies. Applying one of its relations to another kind of operation still requires recovering the corresponding subjects and events. Oliveira, Sagawa and Mušič (2025) offers a continuous, feedback-controlled workload account as another choice. For sustained aggregate regulation, a compact continuous account can avoid event-level detail; use it when its flow relation and capacity-control mechanism fit the operation. For an individual deadline, retain the individual completion relation or obtain a justified bound; continuous draining alone does not determine that event.
Dietz and Mulder’s Enterprise Ontology (2020), §§4.4.4–4.4.6, distinguishes acts that produce a result from acts that establish and discharge commitments, and distinguishes their coordination structure from one sequential flow. The useful contribution here is to preserve request, promise and acceptance relations while calculating the work and resources that carry them. This method does not adopt a universal tree structure, human-only agency or a claim that the organizational model alone determines every operating consequence. Section :5.4 keeps an unchanged authority arrangement while changing the product route; a different proposal changes the acceptance relation and therefore needs another supplying method.
Anderson’s Kanban (2010), chapter 1 and chapter 10’s capacity-allocation discussion, combines regulation of work in progress with an approach to introducing changed practice. The Kanban change principles explicitly distinguish change management from service delivery. Use the relevant operating rule and assess its introduction separately. In particular, allocating WIP slots among work classes does not by itself establish staffing, elapsed service time or the authority to change a commitment. Those remain modeled conditions.
Constructing an alternative requires more than predicting the incumbent. The production mechanisms compared in OPS.Reference:19.3 support :4.2a’s arrangement choices. Section :5.5 derives an alternative from the receiving conditions. C.32.MWA.PP supplies the general comparison of method, performer and provision; this pattern retains the operating dependencies and calculations.
Reconsider this choice when a changed promise, resource or policy makes an omitted relation affect the answer, or when an alternative construction obtains the same required answers with less inquiry and maintenance. Trace a newly observed coupling to the answers that depend on it.
OPS.11.1:12 - Relations
OPS.11 identifies interacting operating structures; this method constructs and reconciles the accounts needed to reason about their consequences. OPS.19 uses the result when several work scopes and outcomes constrain one choice.
OPS.3 recovers operating subjects. OPS.8 supplies readiness, release and protection; OPS.10 addresses capacity and service; OPS.15 and OPS.15.1 supply the event-defined account. OPS.16 uses the current and proposed operating networks to bound an improvement or trial. OCE.4 and OCE.6 supply contribution design and effective assignments when those organizational relations must change; OCE.11 coordinates an organization change with continuing service. Existing assignments and their resource consequences can be modeled here without redesigning those relations.
C.32.MWA supplies practice-architecture synthesis; C.32.MWA.PP constructs and compares performance and provision across methods, performers, means and allocations. Use C.39 to find or develop a missing way to obtain a required contribution. C.29 connects mathematical descriptions to their subjects; C.29.1 develops result preservation between mathematical accounts. MMP.18 constructs mathematical coupling, MMP.10 the joint constraints, and C.29.2 the computational formulation. B.5.MPC and its revision method coordinate a change crossing these contributions.