Understanding Johnson's Rule

Johnson's rule is a method used in operations research and production scheduling. It is specifically designed to minimize the total completion time (makespan) for sequencing a set of jobs that must pass through two machines or work centers in the same order.

Let's look at the options provided:

• Sequencing problem: This involves determining the order in which a set of jobs should be processed on one or more machines to optimize some criterion, like minimizing total completion time, minimizing lateness, etc. Johnson's rule directly addresses a specific type of sequencing problem (n jobs on 2 or 3 machines with specific flow patterns).
• Assignment problem: This is a type of optimization problem where tasks are assigned to resources (e.g., jobs to machines, workers to jobs) typically to minimize cost or maximize profit. It's a different mathematical model, often solved using techniques like the Hungarian algorithm.
• Aggregate planning: This is a medium-range capacity planning process that typically covers a planning horizon of 2 to 18 months. It involves determining the quantity and timing of production for a company's product lines or families of products. It is at a higher level than job sequencing.
• Scheduling: This is a broader term that involves determining the timing and sequence of operations. While sequencing is a part of scheduling, Johnson's rule is a specific technique primarily for sequencing jobs on machines, not the entire domain of scheduling which can include resource allocation, time constraints, etc.

Based on its definition and application, Johnson's rule is a fundamental technique used explicitly for solving a particular class of sequencing problems to find the optimal order of processing jobs.

Therefore, Johnson's rule is used for sequencing problems.