Abstract—Challenging combinatorial optimization problems are encountered even in the job shop scheduling problems. This paper works reveals with minimizing the total holding cost of completed and in-process products subject to no tardy jobs with Sheep Flocks Heredity Model Algorithm (SFHM) and Shuffled Frog Leaping Algorithm (SFLA) for job shop scheduling problem (JSP). Heuristics algorithms are developed in scholastic search way in which natural big buoyancy is maintained with respect to optimum schedule. Results are produced and compared with literature results in terms of total holding cost, stipulated time and computational time. SFL algorithm performs result oriented than other Heuristics Algorithm.