Abstract The job shop scheduling is typical task which can optimize the utilization facilities in this paper scheduling problem for 5 jobs on 5 machine is presented to determine the optimal priority sequence of the jobs shifting bottleneck algorithm is considered the make span obtained from the algorithm is compare with lekin software