Exercise 7.2 – Sequencing jobs on two and three machinesClass 12 Commerce Maths · Chapter 7 Assignment Problem and Sequencing · Exercise 7.2 – Maharashtra Board

Textbook: Mathematics and Statistics (Commerce) Part II – Class 12 (Balbharati, official free PDF) · pages 119–126

When several jobs must pass through the same machines in the same order — cutting then stitching, printing then binding — the order of the jobs changes how long the whole batch takes. A sequencing problem finds the order that finishes everything soonest. This exercise uses Johnson's rule for n jobs on two machines, extends it to three machines through two imaginary machines G and H, and then draws up the time table to find the total elapsed time and the idle time of each machine.

🎧 Listen to the summary

Summary: Exercise 7.2 – Sequencing jobs on two and three machines

A sequencing problem finds the order of jobs through machines that minimises the total elapsed time.

Johnson's rule (two machines A, B): pick the smallest time; if it is on A put that job as early as possible, if on B as late as possible; delete it and repeat.

Three machines A, B, C can be reduced to two if min A ≥ max B or min C ≥ max B; then use G = A + B and H = B + C.

After finding the order, build an in–out table on the real machines to get the total elapsed time T.

Idle time of a machine = T − (sum of its processing times).

Key points to remember

  • Assumptions: one job at a time on a machine, no interruption once started, times independent of order, negligible transfer time.
  • Total elapsed time: from the start of the first job on the first machine to the end of the last job on the last machine.
  • Idle time: time a machine is available but has no job.
  • Ties in Johnson's rule: if the minimum is the same on A for two jobs, either may go first; on B, either may go last; if a tie is between A and B, put the A-job first and the B-job last.
  • A job leaves machine A and starts on B at max(its finish on A, B's finish of the previous job).
  • Machine B is always idle at the start until the first job finishes on A.
  • For three machines, check the condition first; if neither holds, this method cannot be used.
  • G and H are fictitious machines used only to find the order.
  • Always compute T with the original machine times, not G and H.
  • Different optimal orders can give the same minimum T.
Want a teacher to explain Exercise 7.2 – Sequencing jobs on two and three machines?

Get a ✓ Verified tutor for “Exercise 7.2 – Sequencing jobs on two and three machines” — 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