Sequencing n-jobs m-machines || Johnson's Algorithm || Operations Research || Idle time

This video explains the sequencing of n-jobs through m-machines using Johnson's algorithm. The algorithm considers the processing time as a criteria to find the optimal sequence in which the n-jobs are processed through 2-Machines. This can be extended to solve n-Jobs processed through m-Machines. In this video, the application of Johnson's algorithm to solve the 5 Jobs to be processed through 4 Machines. The Johnson's algorithm is used to find optimal sequence in which jobs should be processed through the Machines in the same order and to find idle time on machines.