Calculate a feasible sequence when jobs share machines

State the production contract

Google’s job-shop definition requires task precedence, exclusive machine use and uninterrupted processing. Here both fictional jobs visit X then Y; all equipment is available from hour zero.

Name the operation being scheduled, not merely the finished deliverable. In a creative production brief, printing and finishing can have different acceptance conditions and equipment needs. Ask the owner which operation actually releases the input required by the next one. Do not silently treat a partially inspected batch as ready because doing so makes the timetable shorter.

Keep this exercise confined to machines and invented work. The production owner must separately confirm that the proposed operating conditions are appropriate before anyone applies the result. A timing model cannot certify a material, approve equipment use or remove a required inspection. Recording those limits makes the calculation useful without disguising it as an authorized operating instruction.

Compare complete occupied intervals

Let A require four hours on X and one on Y; B requires one on X and four on Y. Intervals include their start and exclude their end. A first gives AX [0,4), AY [4,5), BX [4,5), BY [5,9). B first gives BX [0,1), BY [1,5), AX [1,5), AY [5,6).

Check each duration by subtracting start from end. For each job, its Y start must be at least its X end. On each machine, one interval must end by the other’s start. Both rows pass: their final completions are nine and six hours.

PyJobShop documents a solution through assigned resources and task start/end times. This illustration uses independent enumeration, not a PyJobShop solver result.

Read the rows by machine as well as by job. A presentation organized only around deliverables can conceal the very conflict under investigation. Retain the slower feasible plan: it explains the consequence of the proposed sequence better than a lone preferred date. A receiver should be able to point to the exact operation being moved, rather than infer that the recommendation depends on working faster.

Justify the completion bound

X must perform five hours of work. Its last job then needs at least one hour on Y, so no schedule can finish before hour six. The second plan attains that bound. Local enumeration tested 10,000 integer start vectors from zero through nine, finding 246 feasible vectors and the same minimum.

The bound explains why the result is more than the better of two attractive sketches. It remains important to state what was searched and what was proved separately. The enumeration checks a finite representation; the workload argument supports the claimed finish under the stipulated timing model. Neither step establishes how uncertain actual production will unfold.

Before recommending the sequence, ask what the short first operation represents operationally. Does preparing that batch require an omitted setup, or is its input genuinely available? If the owner supplies a missing condition, rebuild the comparison rather than attaching a footnote to the old finish. Preserve the original exercise so the team can distinguish a changed model from a calculation error.

Turn the calculation into a bounded decision

Bring the proposed sequence, its complete occupied periods and the unresolved operating questions to the production owner together. Avoid presenting only a headline time saving. The owner needs to see whether the recommendation changes the use of equipment, the order of accepted work or an existing external commitment. Those consequences may matter even when the arithmetic is persuasive.

If an operational constraint prevents the preferred plan, explain the conflict explicitly. Do not force the model to agree with a promised date by shortening an activity without evidence. A useful next step might be clarifying a preparation requirement or checking an independently proposed alternative, but it must remain within the owner’s authority.

Keep the final decision separate from this teaching result. No customer deadline, equipment reservation or employee schedule has been changed. A defensible handoff explains the stipulated alternative and the evidence still needed for a real decision. That is more valuable than a polished chart whose apparent precision conceals an untested production assumption.

Make the reasoning concrete.

A fictional studio wants to prepare two display batches. Both proposed timetables use the same equipment and supplied durations; the production owner asks why changing the order could matter.

The studio requests confirmation of the operating assumptions before considering a real schedule. It makes no reservation or delivery promise.

Take the questions into your next brief.

Use these prompts in your own notes. Nothing is submitted from this page.

1. Operations

   What does each production step actually include?

2. Inputs

   Which durations and equipment conditions are supplied assumptions?

3. Periods

   Can another reviewer verify every displayed interval?

4. Bound

   What justifies the claimed best finish in this model?

5. Decision

   Which operating fact could invalidate the recommendation?

Watch for the wrong conclusion.

• Approving a chart from its appearance alone.
• Omitting preparation work because it complicates the comparison.
• Calling a fictional difference a realized production saving.

Sources & scope

Original fictional inputs, local calculations and operational interpretation. Sources support identified mechanisms and their applications. No operational change, commercial commitment or personnel decision is made.

• The Job Shop Problem →Primary software teaching documentation · Supports: Supports the scheduling constraints.
• Introduction to scheduling →Primary software documentation · Supports: Supports timetable representation.