Miscellaneous Exercise 7 – Revision of assignment and sequencing problemsClass 12 Commerce Maths · Chapter 7 Assignment Problem and Sequencing · Miscellaneous Exercise 7 – Maharashtra Board

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.

🎧 Listen to the summary

Summary: Miscellaneous Exercise 7 – Revision of assignment and sequencing problems

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.

Key points to remember

  • Balanced assignment problem: square cost matrix (rows = columns).
  • Rows > columns → add a dummy column; columns > rows → add a dummy row.
  • Maximisation: subtract every entry from the largest entry (opportunity loss).
  • Optimality: minimum number of covering lines = order of the matrix.
  • Assignments are made only in zero cells of the reduced matrix.
  • With n jobs and m machines there are (n!)ᵐ possible sequences.
  • Sequencing assumptions: one job at a time per machine, no passing, known times independent of order, negligible handling time.
  • In Johnson's rule, ties on the same machine can be broken either way; the elapsed time is the same.
  • Read assignment totals from the original table.
  • When several assignments give the same total, the problem has multiple optimal solutions.
Want a teacher to explain Miscellaneous Exercise 7 – Revision of assignment and sequencing problems?

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.

Get a tutor for this chapter →

👩‍🏫 Class 12 Commerce Maths Book classes — live online, request a call back

Prefer 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.

Live online classesSmall groups or 1:1 with a teacher, from home, any city.
We call you backOur team asks what your child needs, then shares timings and fees.
Home tutor?We are still building our list of home tutors — ask on the call if there is one near you.

Keep learning