Jssp is a kind of typical machine scheduling problem. The earliest machine scheduling problems found in the literature are two and three stage scheduling problems with setup times included (johnson, 1954). for all the jobs have identical operations, the problems are corresponding to two and three machine flow shop scheduling problems, with the objective. Job shop scheduling, machine shop, make tries to minimize the effect of the bottleneck process span, shifting bottleneck. Through iterative method in finding maximum makespan i. Introduction (cmax) and maximum lateness time (lmax). Job shop scheduling is a special case of production scheduling. Job shop scheduling environments are characterized by: Engineering tasks that may constrain the schedule. Typically long routings, or routings of some complexity. Multiple simultaneous constraints , for example, both labor and.