Shuffled Frog Leaping Algorithm for Solving Optimization of Total Holding Cost in Job Shop Scheduling Problems

The manufacturing System is enabled with an excellent knowledge of the production plan and proper scheduling of machinery process. Challenging combinatorial optimization problems are encountered even in the job shop scheduling problems. Heuristics algorithms are developed in a scholastic search way in which natural big buoyancy is maintained. These are developed to bring optimized results in stipulated time with respect to optimally schedule. This article deals with minimizing the total holding cost of completed and in-process products with consideration of tardy jobs and without consideration of tardy jobs with Shuffled Frog Leaping Algorithm (SFL). Applying SFL algorithm to minimize the total holding cost which is the sum of earliness finished product inventory holding cost, intermediate inventory holding costs, work in process and tardiness. Several benchmark problems of different sizes, which are commonly used for Job Shop Scheduling Problems of minimizing the total holding costs and makespan are produced. The Results are compared with literature results in terms of total holding cost, stipulated time and computational time the Shuffled Frog Leaping algorithm performs result oriented than other Heuristics Algorithm.