Job Sequencing - 1 Processing 'n' jobs on 2 machines Johnson's Rule

#Operations Research
#Job Sequencing
#Johnson's Rule
#Processing 'n' jobs on 2 machines

Steps for solution:
Step - 1
Arrange the data in a tabular form showing job-wise processing
time on each of the two machines.

Step - 2:
Find out the least processing time in the whole table

Step - 3
(i) If the least processing time is on Machine-1, then process that job first (place it in the beginning of the 'Job Sequencing Schedule')
(ii) If the least processing time is on Machine-2, then process that job last (place it at the end of the 'Job Sequencing Schedule')
(iii) If there is a tie in the least processing time on Machine-1, then the job with the least total time will be processed first and then the other job(s) after that job in the same manner.
(iv) If there is a tie in the least processing time on Machine-2, then the job with the least total time will be processed last and the other job(s) before that job in the same manner.

Step - 4
To prepare Schedule/Statement of Minimum Total Time Elapsed and Idle Time of machines

MBA, MCA, BE, CA, CS, CWA, CMA, CPA, CFA, BBA, BCom, MCom, BTech, MTech, CAIIB, FIII, Graduation, Post Graduation, BSc, MSc, BA, MA, Diploma, Production, Finance, Management, Commerce, Engineering

[umeshgore]

Thank you very much. Your lectures helped me a lot .

[MohammedIbrahim-zbqp]

Thanks alot sir .U helped us by providing possibilities that comes in solving problems and how to solve

[MS-fhud]

What we done when t1j = t2j... Or says time on machine 1 and machine 2 are same...