A New Approach to the Permutation Flow Shop Scheduling

In this project, the permutation flow shop scheduling problem is considered. One of the established methods for two machine scheduling problem is modified and extended to provide a solution for permutation flow of scheduling problem. The solution methodology consists of a square matrix (taking n jobs as rows and n machines as Column�s). The job sequence generated by applying the Johnson�s method in multi-stages. On processing time to minimize make span. Comparing the new method with other existing heuristic method like NEH method.