Optimization of multi objective Job Shop Scheduling problems using Firefly algorithm

摘要

Scheduling is the allocation of resources over time to carry out a collection of tasks assigned in any field of engineering and non engineering. Majority of JSSP are categorized into non deterministic (NP) hard problem because of its complexity. Scheduling are generally solved by using heuristics to obtain optimal or near optimal solutions because problems found in practical applications cannot be solved to optimality using available resources in many cases. Many researchers attempted to solve the problem by applying various optimization techniques. While using traditional methods they observed huge difficulty in solving high complex problems and meta-heuristic algorithms were proved most efficient algorithms to solve various JSSP so far. The objective of this paper i) to make use of a newly developed meta heuristic called Firefly algorithm (FA) because of inspiration on Firefly and its characteristic. ii) To find the combined objective function by determining optimal make span, mean flow time and tardiness of different size problems (using Lawrence 1-40 problems) as a bench marking dataset and to find the actual computational time. iii) The analysis of the experimental results on Firefly algorithm based on computational time is compared with other algorithms.