Sequencing with Johnson's Rule

The Two-Workstation Sequencing Problem

Imagine your boudoir photoshoot. Each "look" or "pose set" isn't a single monolithic task. It's a sequence: first, the model gets styled for the look, and second, the photos for that look are shot.

• Job: A specific outfit-pose combination (e.g., Job A: "Silk Robe, Window Poses").
• Workstation 1 (M1): "Styling". This includes changing, makeup and hair adjustments, and setting up specific props for the look. Let's call its duration $a_i$ for job $i$.
• Workstation 2 (M2): "Shooting". The time spent with the photographer capturing the images for that look. Let's call its duration $b_i$ for job $i$.

The critical constraint is that a job cannot begin at M2 (Shooting) until it has finished at M1 (Styling). Also, each workstation can only handle one job at a time. The goal is to find the single sequence of jobs that minimizes the time the last job finishes on M2. This total time is the makespan.

The key to minimizing makespan is to minimize the idle time on the second workstation, M2. This idle time occurs whenever M2 is free, but the next job isn't done with M1 yet. To build an intuition for how to achieve this, let's explore the core logic.

As the reading suggests, the logic revolves around two simple but powerful ideas:

1. To get M2 started as early as possible, the first job in the sequence should have a short processing time on M1.
2. To ensure M2 finishes quickly after M1 is done, the last job in the sequence should have a short processing time on M2.

Johnson's Rule is the elegant algorithm that extends this intuition to the entire sequence of jobs.

Johnson's Rule: The Algorithm

Johnson's algorithm provides a simple, provably optimal method for sequencing N jobs through two machines. The procedure systematically builds the optimal sequence from the outside in.

To summarize the procedure:

1. List the processing times for all jobs on both workstations (M1 and M2).
2. Find the shortest processing time in the entire list.
3. If the shortest time is for M1: Schedule that job as early as possible (i.e., add it to the front of your sequence).
4. If the shortest time is for M2: Schedule that job as late as possible (i.e., add it to the end of your sequence).
5. Remove the scheduled job from consideration.
6. Repeat steps 2-5 until all jobs are scheduled.

If there's a tie for the shortest time, you can break it arbitrarily if the times are on different machines. If they are on the same machine, the theory offers tie-breaking rules, but for practical purposes, any choice will yield an optimal makespan.

Worked Example: Sequencing the Photoshoot

Let's apply this to a boudoir photoshoot with four distinct "looks."

Let's build the optimal sequence, which starts as four empty slots: [ _ , _ , _ , _ ]

• Step 1: The shortest time overall is 5 minutes for Job B on M1. Since it's on M1, we place Job B at the front.
  • Sequence: [ B , _ , _ , _ ]
• Step 2: We remove Job B. The shortest remaining time is 8 minutes for Job C on M2. Since it's on M2, we place Job C at the end.
  • Sequence: [ B , _ , _ , C ]
• Step 3: We remove Job C. The shortest remaining time is 10 minutes for Job A on M1. Since it's on M1, we place it in the next available "front" slot.
  • Sequence: [ B , A , _ , C ]
• Step 4: Only Job D remains. It fills the last slot.
  • Optimal Sequence: [ B , A , D , C ]

Visualizing the Makespan with a Gantt Chart

Now, let's verify that this sequence minimizes makespan by mapping it out.

Sequence: B → A → D → C

The makespan for this sequence is 83 minutes.

Notice how M2 starts at time 5 (as soon as B is done with styling). M2 then works continuously until Job A is done. It has no idle time until after Job A, because the next job (D) isn't ready from styling until time 27, while M2 is free at 45. Then it has to wait for C. A Gantt chart makes this flow clear.

For your reference, the mathematical proof of why this algorithm is optimal involves demonstrating that any swap of adjacent jobs in a Johnson-sequenced schedule cannot reduce the makespan. Given your background in OR, you might find the formal derivation interesting.

Application to Hotwife Intimacy

We can frame a sequence of intimate activities with your bull as a similar two-stage process, allowing you to optimize the "flow" of an entire encounter.

• Jobs: A set of desired intimate activities for an encounter.
• Workstation 1 (M1): "Ramp-up". The time and effort needed for mental and emotional preparation, foreplay, or setting the scene for a specific activity.
• Workstation 2 (M2): "Main Event". The duration of the core activity itself.

Let's say you're planning an evening with three main desired activities:

• Job A: Deep Conversation. (Ramp-up: 20 min, Main Event: 40 min)
• Job B: Shared Massage. (Ramp-up: 5 min, Main Event: 25 min)
• Job C: Intense, specific roleplay. (Ramp-up: 15 min, Main Event: 10 min)

Applying Johnson's Rule:

1. Shortest time is 5 min (Job B, M1). Sequence: [ B , _ , _ ]
2. Next shortest is 10 min (Job C, M2). Sequence: [ B , _ , C ]
3. Job A fills the middle. Final Sequence: [ B , A , C ]

The optimal sequence is to start with the massage (quickest ramp-up), move to the deep conversation, and conclude with the roleplay (shortest main event). This structure minimizes the total duration from the start of the first ramp-up to the end of the final main event, creating the most time-efficient and seamless encounter.

Conclusion

Today we've moved from single-stage to two-stage sequencing. You've learned how to apply Johnson's Rule, a fundamental algorithm for optimizing a flow shop.

Key Takeaways:

• In a two-workstation process, the sequence of jobs directly impacts the total time to completion (makespan).
• Johnson's Rule provides the optimal sequence by scheduling jobs with short first-stage times at the beginning and jobs with short second-stage times at the end.
• This logic can be applied to optimize a photoshoot by sequencing looks based on their 'styling' and 'shooting' times, or to structure an intimate encounter by sequencing activities based on their 'ramp-up' and 'main event' times.

So far, our sequencing rules have assumed all jobs are of equal importance. But what if some looks in the photoshoot are essential "hero" shots, while others are secondary? In our next lesson, we will explore Jackson's Rule, which allows us to incorporate job priorities into our sequencing decisions, adding a critical layer of strategic importance to the schedule.