Even the Permutation Job Shop Scheduling issue (PJSP) is just really a renowned dilemma from the scheduling investigation area. It's definitely really an NP-hard combinatorial optimization issue that's of use real-time software. Inside this issue, locating a helpful algorithm to manage the vast levels of tasks needed to recover an actionable permutation sequence in a fair quantity of time is essential. The newly constructed crow search algorithm (CSA) can be just really a publication swarm-based meta-heuristic algorithm formerly suggested to fix mathematical marketing issues. Inside this article, a study of CSA is proposed to diminish the makespan of all both PFSPs. Initially, to produce the CSA ideal for resolving the PFSP, the smallest spot significance principle is employed to change endless amounts in to project sequences. Then the SSO algorithm is used for job shop scheduling and then the comparative study of SSO with CSA is used.