Application of Firefly Algorithm in Job Shop Scheduling Problem for Minimization of Makespan

Abstract Job shop scheduling problem is a well known scheduling problem in which most of them are categorised into non polynomial deterministic (NP) hard problem because of its complexity. Many researchers intended to solve the problem by applying various optimization techniques. While using traditional methods they observed huge difficulty in solving high complex problems. Later 90's many researchers addressed JSSP by using intelligent technique such as fuzzy logic, simulated annealing etc. After that genetic algorithm (GA), Selective breeding algorithm (SBA), taboo search algorithm and Ant colony algorithm [are popularly known as Meta heuristic algorithms were proved most efficient algorithms to solve various JSSP so far. The objective of this paper is as follows i) to make use of a recently developed meta heuristic called Firefly algorithm (FA) because of inspiration on Firefly and its characteristic.ii) to find the makespan minimization using1-25 Lawrance problems as a bench marking from a classical OR- library.iii) the analysis of the experimental resultson Firefly algorithm is compared with other algorithms.