Efficient Implementation of Johnson's Scheduling Algorithm

Most of the real world scheduling problems are difficult to solve and are named in the scheduling literature as NP-hard. One of the approaches for solving large scale scheduling problems is to decompose them into subproblems which can hopefully be solved by constructive scheduling algorithms. An efficient implementation of Johnson's algorithm for n job two machine scheduling problem has been developed. Computational complexity of the proposed scheduling algorithm is O (nlogn).