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

In job shop scheduling problems, n jobs have to be processed on m different machines. Each job consists of a sequence of tasks that have to be processed during an uninterrupted time period of a fixed length on a given machine. This paper deals with the job shop scheduling problem (JSP) of minimizing the total holding cost with consideration of tardy jobs using Shuffled Frog Leaping Algorithm. Research results from several benchmark problems with different sizes, which are commonly used for optimizing the scheduling objectives, solved by the proposed algorithms are reported. Shuffled Frog Leaping Algorithm gives better results compared with literature results in terms of total holding cost.