Assume you are sequencing jobs using Johnson\'s rule. There are three jobs calle

Question

Assume you are sequencing jobs using Johnson's rule. There are three jobs called A, B and C. The first step in assembling and the second step is painting. Job A requires 3 hours to assemble and 6 hours to paint. Job B requires 7 hours to assemble and 2 hours to paint. Job C requires 4 hours to assemble and 1 hour to paint. The objective is to minimize the total processing time of all jobs, using Johnson’s rule. What is the completion time of the last job in the sequence in the second step (painting)?

14

15

9

12

10

14

15

9

12

10

Explanation / Answer

Select the job with the shortest processing time, if that activity is for Assembly then schedule the job first, if that activity is for Painting, then schedule the job last. Remove the jobs which are scheduled from further consideration. Repeat the process until all jobs are scheduled.

Using Johnson's rule, the optimal sequence is as follows

Completion time of last job in the sequence in second step = 15

Job Assembly Painting Assembly Painting A 3 6 3 9 B 7 2 10 12 C 4 1 14 15

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.