Simple language • Indian examples • Solved numericals • Exam tips
Fundamentals • Production System • Types of Production • Operations Mgmt • Plant Location & Layout • Production Planning • Process Planning
| Type | Meaning | Volume | Example | Cost/Unit |
|---|---|---|---|---|
| Job Production | Each product made individually as per customer spec | Very Low (1 unit) | Custom wedding suit, Bridge construction | Very High |
| Batch Production | Products made in groups/batches | Medium | Bakery (200 chocolate cakes, then 150 vanilla), Pharma medicines | Moderate |
| Mass Production | Large identical quantities continuously | Very High | Maruti Suzuki Alto, Coca-Cola bottles | Very Low |
| Continuous/Process | Production never stops, runs 24x7 | Extremely High | Oil refinery, Steel plant, Cement factory | Lowest |
Three locations for producing telecommunication sets. Selling price = Rs. 90. Volume = 1850 units/year.
| Location | Fixed Cost (Rs.) | Variable Cost/unit (Rs.) | Total Cost = FC + (VC × 1850) |
|---|---|---|---|
| Chennai | 20,000 | 50 | 20,000 + (50×1850) = 20,000 + 92,500 = ₹1,12,500 |
| Coimbatore | 40,000 | 30 | 40,000 + (30×1850) = 40,000 + 55,500 = ₹95,500 |
| Madurai | 80,000 | 10 | 80,000 + (10×1850) = 80,000 + 18,500 = ₹98,500 |
Revenue = 90 × 1850 = ₹1,66,500
| Type | Description | Best For | Example | Advantage | Disadvantage |
|---|---|---|---|---|---|
| Product Layout | Machines in sequence of operations | Mass production | Biscuit factory: Mix→Knead→Cut→Bake→Pack | Low material handling, easy supervision | Inflexible; one breakdown stops all |
| Process Layout | Similar machines grouped in departments | Job/Batch production | Workshop: Lathe dept, Drilling dept, Welding dept | Very flexible, handles variety | High material handling, complex scheduling |
| Fixed Position Layout | Product stays, everything comes to it | Large, heavy products | Shipbuilding, Aircraft, Bridge construction | Minimal product movement | High equipment handling, difficult coordination |
| Combination Layout | Mix of above types | Modern factories | Car factory: Product layout for assembly + Process layout for engine dept | Best of all worlds | Complex to design |
PPC Objectives • Characteristics • Stages • Functions • Challenges • MPC System • Scheduling • Job Assignment • Job Sequencing
| Phase | Function |
|---|---|
| Pre-Production | Demand Forecasting, Capacity Planning, MRP, Process Planning, Routing, Scheduling, Loading |
| During Production | Dispatching, Expediting, Schedule Updates |
| Post-Production | Quality Inspection, Updating Records, Performance Analysis, Feedback to Planning |
Start from TODAY → schedule forward → find EARLIEST completion date
Start from DELIVERY DEADLINE → work backwards → find when to START
Horizontal bar chart. X-axis = time. Each row = job or machine. Bars show when each job is processed.
Network diagrams for complex projects with many interdependent activities.
Time matrix (hours):
| Job X | Job Y | Job Z | |
|---|---|---|---|
| Worker A | 2 | 3 | 1 |
| Worker B | 5 | 4 | 8 |
| Worker C | 3 | 6 | 3 |
Step 1 — Row Reduction: Subtract row min (A=1, B=4, C=3)
| Job X | Job Y | Job Z | |
|---|---|---|---|
| A | 1 | 2 | 0 |
| B | 1 | 0 | 4 |
| C | 0 | 3 | 0 |
Step 2 — Column Reduction: Col minimums are all 0 → No change
Step 3 — Cover zeros: 3 lines cover all zeros (= n=3) ✅ Optimal!
Step 4 — Assign:
| Rule | Description | Optimizes | Example Use |
|---|---|---|---|
| FCFS | First Come First Served — process in arrival order | Fairness | Banks, hospitals, restaurants |
| SPT | Shortest Processing Time first | Average flow time & waiting time (BEST for throughput) | Manufacturing, when quick turnaround needed |
| EDD | Earliest Due Date first | Maximum lateness (meeting deadlines) | When customer delivery promises are critical |
| LPT | Longest Processing Time first | Machine utilization | Less common; keeps machines busy |
| Critical Ratio | CR = Time Remaining ÷ Processing Time Remaining | Dynamic priority (recalculated constantly) | CR<1 = urgent; CR=1 = on track; CR>1 = ahead |
| Job | M1 (Cutting) hrs | M2 (Finishing) hrs |
|---|---|---|
| A | 3 | 6 |
| B | 12 | 2 |
| C | 5 | 14 |
| D | 2 | 7 |
| E | 9 | 4 |
Applying Johnson's Algorithm:
Optimal Sequence: D → A → C → E → B
Makespan Calculation:
| Job | M1 Start | M1 End | M2 Start | M2 End |
|---|---|---|---|---|
| D | 0 | 2 | 2 | 9 |
| A | 2 | 5 | 9 | 15 |
| C | 5 | 10 | 15 | 29 |
| E | 10 | 19 | 29 | 33 |
| B | 19 | 31 | 33 | 35 |