Johnson's Rule Calculator (2-Machine Flow Shop)
Use this tool to find an efficient job sequence that minimizes total completion time (makespan) when every job must pass through Machine 1 and then Machine 2.
What Is a Johnson Calculator?
A Johnson calculator applies Johnson's Rule, a classic scheduling method in operations management. It is designed for a specific but common setup: each job must be processed on two machines in the same order (Machine 1 first, then Machine 2), and you want to minimize the total time required to finish all jobs.
In practical terms, this can represent manufacturing lines, print and finishing workflows, food prep and packaging, or any two-stage process where job order affects waiting time and bottlenecks.
How to Use This Calculator
- Enter processing times for Machine 1 and Machine 2 as comma-separated values.
- Optionally enter custom job names. If omitted, the calculator creates J1, J2, J3, and so on.
- Click Calculate Sequence to generate the Johnson order.
- Review the schedule table, makespan, and machine utilization metrics.
How Johnson's Rule Works
Step 1: Find the smallest processing time
Look across all unscheduled jobs on both machines and identify the smallest time value.
Step 2: Place the job at the front or back
If the smallest time belongs to Machine 1, place that job as early as possible in the sequence. If it belongs to Machine 2, place that job as late as possible.
Step 3: Repeat until all jobs are placed
Continue selecting the next smallest unscheduled time and assigning front/back positions until the sequence is complete.
Why This Matters
Sequencing is often the hidden performance lever in production planning. The exact same jobs can yield very different outcomes depending on order. A better sequence can reduce idle time, shorten cycle time, and improve throughput without buying new equipment.
- Lower total completion time (makespan)
- Less waiting between machine stages
- Higher utilization of constrained resources
- More predictable delivery times
Example Interpretation
Suppose the tool returns sequence D → A → C → E → B. That means process D first on Machine 1, then A, and so on. The table shows when each job starts and ends on both machines. The final completion time on Machine 2 is your makespan.
You can compare this sequence to your current order and immediately see if your present plan is creating unnecessary delay.
Common Input Mistakes to Avoid
- Different counts of times for Machine 1 vs Machine 2
- Using text values instead of numbers
- Negative durations
- Adding extra commas that create blank entries
Limitations of Johnson's Rule
Only for two-machine flow shops
Johnson's Rule is optimal for the two-machine case. For three or more machines, results are not generally guaranteed optimal and other heuristics or optimization methods may be needed.
Assumes deterministic processing times
If processing times are highly variable in real operation, use the result as a planning baseline and update sequence as conditions change.
Final Thoughts
This Johnson calculator gives you a fast, practical way to improve schedule quality for two-stage processes. If your team is still ordering jobs by intuition, this is one of the easiest analytical upgrades you can adopt.