TalentJR apps
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.
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).
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.
Jobs X (A 2 h, B 5 h) and Y (A 4 h, B 1 h). Compare the orders X–Y and Y–X.
Answer: X–Y, total 8 hours
Jobs J1–J4 with A: 4, 1, 5, 3 and B: 2, 6, 4, 7. Find the best order, T and idle times.
Answer: J2–J4–J3–J1; T = 20 h; idle A 7 h, B 1 h
Jobs P, Q, R with A: 6, 5, 7; B: 2, 4, 3; C: 5, 6, 4. Find the order and T.
Answer: Q–R–P; T = 25
In the P, Q, R example, find the idle times of A, B and C.
Answer: 7 h, 16 h, 10 h
| What | Formula | Symbols |
|---|---|---|
| Johnson's rule | min on A → as early as possible; min on B → as late as possible | J2 first, J1 last |
| Start on next machine | start = max(finish on previous machine, machine free time) | J4 on B starts at 7 |
| Three-machine condition | min A ≥ max B or min C ≥ max B | 5 ≥ 4 |
| Fictitious machines | G = A + B, H = B + C | G = 8, 9, 10; H = 7, 10, 7 |
| Total elapsed time | finish of last job on last machine | T = 20 |
| Idle time | T − Σ(processing times on that machine) | 20 − 13 = 7 |
Solve each one in your notebook first. Then open the solution and compare every step.
1. Q1. Six jobs: turning 3, 12, 5, 2, 9, 11 and threading 8, 10, 9, 6, 3, 1 minutes. Find the order, total time and idle times.
Answer: 4–1–3–2–5–6; T = 43 min; idle turning 1 min, threading 6 min
2. Q2. Jobs I, II, III: press shop 8, 6, 5 days; finishing 8, 3, 4 days. Find the order and idle times.
Answer: I–III–II; T = 23 days; idle A 4 days, B 8 days
3. Q3. Policies 1, 2, 3: data entry 90, 120, 180 min; filing 140, 110, 100 min. Find the order, T and idle times.
Answer: 1–2–3; T = 490 min; idle 100 min and 140 min
4. Q4. Jobs A–E on X then Y: X 10, 2, 18, 6, 20; Y 4, 12, 14, 16, 8 hours. Find the order, T and idle times.
Answer: B–D–C–E–A; T = 60 h; idle X 4 h, Y 6 h
5. Q5. Jobs I–VII on A then B: A 7, 16, 19, 10, 14, 15, 5; B 12, 14, 14, 10, 16, 5, 7. Find the order, T and idle times.
Answer: VII–I–IV–V–III–II–VI; T = 91; idle A 5, B 13
6. Q6 (i). Jobs I–VII on A, B, C: A 6, 7, 5, 11, 6, 7, 12; B 4, 3, 2, 5, 1, 5, 3; C 3, 8, 7, 4, 9, 8, 7 hours.
Answer: III–V–II–VI–VII–IV–I; T = 61 h; idle A 7, B 38, C 15
7. Q6 (ii). Jobs 1–5 on A, B, C: A 5, 7, 6, 9, 5; B 2, 1, 4, 5, 3; C 3, 7, 5, 6, 7.
Answer: 2–5–4–3–1 (or 5–4–3–2–1); T = 40 h; idle A 8, B 25, C 12
8. Q7. Books A–E on P, Q, R: P 4, 9, 8, 6, 5; Q 5, 6, 2, 3, 4; R 8, 10, 6, 7, 11. Find the minimum total time.
Answer: A–D–E–B–C (or equivalent); T = 51 units; idle P 19, Q 31, R 9
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. In Johnson's rule, a job whose smallest time is on machine B is placed
Answer: C. It keeps B busy until the end.
2. Idle time of machine A equals
Answer: C. Total minus busy time.
3. A three-machine problem can be reduced if
Answer: C. Book condition.
4. For three machines G =
Answer: A. Fictitious first machine.
5. Total elapsed time ends when
Answer: A. Definition.
6. Jobs X (2, 5) and Y (4, 1) on A then B. Best order and T:
Answer: B. Short A first, short B last.
7. A job finishes on A at 9; B finishes its previous job at 7. The job starts on B at
Answer: A. max(9, 7).
8. Ex 7.2 Q2 (A: 8, 6, 5; B: 8, 3, 4) optimal order is
Answer: C. Smallest 3 on B → II last; then 4 on B → III.
9. For J1–J4 with A 4, 1, 5, 3 and B 2, 6, 4, 7, T =
Answer: D. From the in–out table.
10. Sequencing assumes
Answer: C. Standard assumptions.
11. Ex 7.2 Q3 (policies 1, 2, 3) total elapsed time is
Answer: C. Order 1–2–3.
12. Ex 7.2 Q4 optimal order is
Answer: C. B first (2 on X), A last (4 on Y).
13. Machine B in a 2-machine problem is idle at the start for
Answer: D. It waits for job 1.
14. Ex 7.2 Q7 (books on P, Q, R) minimum time is
Answer: C. A–D–E–B–C or similar.
15. G and H are
Answer: D. Used only to find the order.
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.
Done with the notes? Revise Exercise 7.2 – Sequencing jobs on two and three machines 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 55 minutes
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.
Sign in free to see the answers to the textbook exercise of Exercise 7.2 – Sequencing jobs on two and three machines.
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 Ex 7.2” — 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.