Which of the following is not a type of scheduling problem? ans. Single Machine Flow Shop Job-Shop Young Shop

Step 1: Break Down the Problem

We are asked to identify which option is not a recognized type of scheduling problem. The options given are:

1. Single Machine
2. Flow Shop
3. Job-Shop
4. Young Shop

Step 2: Relevant Concepts

• Single Machine Scheduling: This involves scheduling jobs on a single machine.
• Flow Shop Scheduling: This type focuses on scheduling a series of jobs through multiple machines in a predefined order.
• Job-Shop Scheduling: Here, jobs are processed on machines in a flexible order based on the specific requirements of each job.
• Young Shop: This term does not correspond to any standard scheduling theory or problem known in operations management or scheduling literature.

Step 3: Analysis and Detail

• Analyzing the first three terms shows they are established concepts in scheduling problems.
• The fourth term, "Young Shop," appears to be a non-standard or erroneous term, as it does not have a basis in scheduling theory.

Step 4: Verify and Summarize

Among the terms listed, the first three are recognized types of scheduling problems, while "Young Shop" does not relate to any known scheduling methodology.

Final Answer

The option that is not a type of scheduling problem is Young Shop.