z-logo
open-access-imgOpen Access
A Hybrid Firefly Algorithm Approach for Job Shop Scheduling Problem
Author(s) -
Gayathri Devi K
Publication year - 2021
Publication title -
international journal for research in applied science and engineering technology
Language(s) - English
Resource type - Journals
ISSN - 2321-9653
DOI - 10.22214/ijraset.2021.39536
Subject(s) - job shop scheduling , firefly algorithm , simulated annealing , heuristics , computer science , mathematical optimization , matlab , flow shop scheduling , scheduling (production processes) , firefly protocol , algorithm , mathematics , routing (electronic design automation) , computer network , zoology , particle swarm optimization , biology , operating system
Job shop scheduling has always been one of the most sought out research problems in Combinatorial optimization. Job Shop Scheduling problems (JSSP) are categorized under NP hard problems. In recent years the meta heuristic algorithms have been proved effective to solve hardcore NP problem. Firefly Algorithm is one of such meta heuristic techniques which is nature inspired from firefly characteristic. Its potential can be enhanced further by hybridizing it with other known evolutionary algorithms and thereby getting improved results in less computational time. In this paper we have proposed a new hybrid technique christened as HyFA, by hybridizing Firefly algorithm(FA) with simulated annealing (SA) and Greedy heuristics approach (GHA). The hybrid technique has the advantages of all three algorithms and are combined in such a way that a quicker and better optimal solution is obtained. Our proposed HyFA is coded in Matlab with an objective to minimize the makespan (Cm). The novel hybrid technique is then used to evaluate 1-25 Lawrence problems taken from literature. The results show the proposed technique is more effective not only in getting optimal results but has significantly reduced computational time. Keywords: Scheduling, Optimisation, Job shop scheduling, Meta-heuristics, Firefly, Simulated Annealing, Greedy heuristics Approach.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here