TalentJR apps
Textbook: Mathematics and Statistics (Commerce) Part II – Class 12 (Balbharati, official free PDF) · pages 108–131
This exercise revises both halves of Chapter 7. Part I is about assignment problems — minimising man-hours or distance, maximising sales, unbalanced tables with dummy rows or columns, and forbidden cells. Part II is about sequencing jobs through two or three machines with Johnson's rule and computing the total elapsed time and idle times. The objective questions and activities test the underlying ideas, such as why adding a constant to a row does not change the best assignment.
Assignment: make the table square (dummy row/column of zeros), put M in forbidden cells, convert profits to regrets, then apply the Hungarian method.
The optimal assignment does not change if a constant is added to or subtracted from a whole row or column.
Sequencing on two machines: Johnson's rule; on three machines: check min A ≥ max B or min C ≥ max B, then use G = A + B, H = B + C.
Total elapsed time comes from the in–out table; idle time of a machine = T − its total processing time.
If the three-machine condition fails, Johnson's reduction cannot be used.
Get a ✓ Verified tutor for “Miscellaneous Exercise 7 – Revision of assignment and sequencing problems” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Costs of three workers on three jobs: A: 11, 16, 21; B: 20, 13, 17; C: 13, 15, 12. Find the best assignment.
Answer: A→X, B→Y, C→Z; cost 36
Cost matrix rows (2, 4, 6), (3, 5, 7), (8, 10, 12). Find the minimum total.
Answer: Every assignment gives 19
Printing 5, 8, 10, 7 h and data entry 7, 4, 3, 6 h for books A–D. Find the best order.
Answer: A–D–B–C
min A = 13, max B = 15, min C = 14. Can the problem be reduced to two machines?
Answer: No
| What | Formula | Symbols |
|---|---|---|
| Dummy | rows > columns → dummy column; columns > rows → dummy row | 4 salesmen, 5 territories → dummy row |
| Regret table | largest entry − entry | 39 − 34 = 5 |
| Optimality | covering lines = n | 4 lines for 4 × 4 |
| Number of sequences | (n!)ᵐ | 3 jobs, 2 machines: 36 |
| Three-machine test | min A ≥ max B or min C ≥ max B | 12 ≥ 12 |
| Fictitious machines | G = A + B, H = B + C | G = 26, 32, 16, 20, 30 |
| Idle time | T − Σ times on the machine | 102 − 84 = 18 |
Solve each one in your notebook first. Then open the solution and compare every step.
1. I. Choose the correct alternative, Q1–7.
Answer: 1 c, 2 b, 3 c, 4 d, 5 b, 6 d, 7 a
2. I. Choose the correct alternative, Q8–14.
Answer: 8 a, 9 d, 10 c, 11 a, 12 a, 13 b, 14 b
3. II. Fill in the blanks, Q1–10.
Answer: As listed
4. III. True or False, Q1–10.
Answer: 1 F, 2 T, 3 F, 4 T, 5 F, 6 T, 7 T, 8 F, 9 T, 10 F
5. Part I Q1. Men A–D, tasks I–IV, hours A: 7, 25, 26, 10; B: 12, 27, 3, 25; C: 37, 18, 17, 14; D: 18, 25, 23, 9. Minimise man-hours.
Answer: A→I, B→III, C→II, D→IV; 37 man-hours
6. Part I Q2. Tankers to routes A–E, distances A: 150, 120, 175, 180, 200; B: 125, 110, 120, 150, 165; C: 130, 100, 145, 160, 175; D: 40, 40, 70, 70, 100; E: 45, 25, 60, 70, 95. Minimise distance.
Answer: A→II, B→III, C→V, D→I, E→IV; 525 km
7. Part I Q3. Salesmen A–D, territories I–V, sales A: 11, 16, 18, 15, 15; B: 7, 19, 11, 13, 17; C: 9, 6, 14, 14, 7; D: 13, 12, 17, 11, 13. Maximise sales.
Answer: A→V, B→II, C→IV, D→III (I unserved); 65 units
8. Part I Q4. Managers I–V, cities P–S, sales I: 34, 36, 33, 35; II: 33, 35, 31, 33; III: 37, 39, 35, 35; IV: 36, 36, 34, 34; V: 35, 36, 35, 33. Maximise sales.
Answer: P→IV, Q→III, R→V, S→I (II idle); 145 tons
9. Part I Q5. Operators A–E, machines 1–5, costs A: 6, 6, —, 3, 7; B: 8, 5, 3, 4, 5; C: 10, 4, 6, —, 4; D: 8, 3, 7, 8, 3; E: 7, 6, 8, 10, 2 (A not on 3, C not on 4).
Answer: Minimum cost 20, e.g. A→4, B→3, C→2, D→5, E→1 (multiple optima)
10. Part I Q6. Employees E1–E5, cases I–V, days E1: 6, 4, 5, 7, 8; E2: 7, —, 8, 6, 9; E3: 8, 6, 7, 9, 10; E4: 5, 7, —, 4, 6; E5: 9, 5, 3, 10, —.
Answer: Minimum 27 days (E1→I, E2→IV, E3→II, E4→V, E5→III)
11. Part II Q1. Items 1–7: cutting 5, 7, 3, 4, 6, 7, 12; sewing 2, 6, 7, 5, 9, 5, 8 h. Find the order and idle times.
Answer: 3–4–5–7–2–6–1; T = 46 h; idle 2 h and 4 h
12. Part II Q2. Jobs I–V: lathe 4, 1, 5, 2, 5; grinder 3, 2, 4, 3, 6 h.
Answer: II–IV–V–III–I; T = 21 h; idle 4 h and 3 h
13. Part II Q3. Jobs I–VII on A then B: A 12, 6, 5, 11, 5, 7, 6; B 7, 8, 9, 4, 7, 8, 3 min.
Answer: III–V–II–VI–I–IV–VII; T = 55; idle A 3, B 9
14. Part II Q4. Toys 1–5 on A, B, C: A 16, 20, 12, 14, 22; B 10, 12, 4, 6, 8; C 8, 18, 16, 12, 10 h.
Answer: 3–2–5–4–1; T = 102 h; idle A 18, B 62, C 38
15. Part II Q5. Jobs 1–4 through shaping 13, 18, 8, 23; drilling 3, 8, 6, 6; tapping 18, 4, 13, 8 min.
Answer: 3–1–4–2; T = 74 min; idle 12, 51, 31 min
16. Activities I (1–3). (1) A, B, C on X, Y, Z (11, 16, 21 / 20, 13, 17 / 13, 15, 12): list all assignments. (2) Show that adding a constant to a row leaves the optimum unchanged. (3) Use 1–9 row-wise as a cost matrix.
Answer: (1) 36 (2) proved (3) every assignment = 15
17. Activities I (4–5). (4) Costs aᵢⱼ: row A: 3i + 4j, 2j² + 5i, 5j − 3i; row B: i³ + 8j, 7i + j², 4i + j; row C: 2i² − 1, 3i + 5j, i³ − 4j. (5) Salesmen S1–S4 and customers C1–C3 with sale probabilities and profits Rs 500, 450, 540.
Answer: (4) Rs 3,700 (5) C1–S4, C2–S3, C3–S2; Rs 1,156
18. Activities II. (2) A-times 4, 6, 8, 9, 10 for jobs I–V and B-times 9, 7, 5, 3, 1. (3) A: 2½, 5/2, ½, 2¾, 3¼, 9/4; B: 3½, 4½, 7/4, 2¼, 5/4, 1½. (5) Seven jobs on X, Y, Z.
Answer: (2) T = 38 (3) T = 16 (5a) method not applicable (5b) T = 149
Read the question, answer it in your head, then tap the card to check. 20 cards.
15 questions. Tap an option — you will see at once if it is right and why.
1. The assignment problem is solved by the
Answer: A. Matrix reduction.
2. With n jobs and m machines the number of sequences is
Answer: A. Each machine can take any of n! orders.
3. Jobs A–D with times 5, 6, 8, 4 and 4, 7, 9, 10. Optimal order:
Answer: D. D first (4 on 1st), A last (4 on 2nd).
4. A profit-maximising assignment problem needs
Answer: B. Then minimise.
5. Agents 1–4, jobs A–D (10, 12, 15, 25 / 14, 11, 19, 32 / 18, 21, 23, 29 / 15, 20, 26, 28). Optimal:
Answer: D. Total 70.
6. An assignment problem is unbalanced if
Answer: B. Either more rows or more columns.
7. If rows exceed columns, add
Answer: B. To make it square.
8. 3 machines, mins 5, 1, 3 and maxes 9, 5, 7 on A, B, C. Reduction works in the order
Answer: A. min A = 5 ≥ max B = 5.
9. Objective of an assignment problem:
Answer: D. Option (b).
10. A wrong assumption in 2-machine sequencing is
Answer: A. Times are independent of order.
11. Workers A, B, C on X, Y, Z with costs 11, 16, 21 / 20, 13, 17 / 13, 15, 12. Minimum cost:
Answer: A. A–X, B–Y, C–Z.
12. Matrix with rows (1, 2, 3), (4, 5, 6), (7, 8, 9): minimum total
Answer: A. Every assignment sums to 15.
13. Readymade garments problem (Part II Q1) total elapsed time is
Answer: A. Order 3–4–5–7–2–6–1.
14. Lathe–grinder problem (Part II Q2) optimal order is
Answer: B. Johnson's rule.
15. Shaping–drilling–tapping (Part II Q5) total time is
Answer: D. Order 3–1–4–2.
Get a ✓ Verified tutor for “Miscellaneous Exercise 7 – Revision of assignment and sequencing problems” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Done with the notes? Revise Miscellaneous Exercise 7 – Revision of assignment and sequencing problems the fun way: match key terms, beat the 60-second lightning round and spot true or false facts. Every game uses only this lesson, so each round is real exam revision.
⭐ 0 XP⏱ About 85 minutes
Get a ✓ Verified tutor for “Miscellaneous Exercise 7 – Revision of assignment and sequencing problems” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Sign in free to see the answers to the textbook exercise of Miscellaneous Exercise 7 – Revision of assignment and sequencing problems.
Sign in to see solutionsStuck on a question? Type it, 🎤 speak it or 📷 snap a photo of it and get simple, step-by-step help with “Assignment Problem and Sequencing Miscellaneous Exercise 7” — important questions, a quick quiz, revision notes — in English, मराठी or हिंदी.
Sign in with Google to ask the AI tutor. It's free — 20 questions a day, one TalentJR account.
Sign in to askPrefer a real teacher? TalentJR teachers take live online classes anywhere in India. Tell us what you need and our team will call you with timings and fees.