Solving Job Scheduling Problem Using Fireworks Algorithm


Scheduling is critical part in most creation frameworks and information processing as sequencing of tasks or jobs framework executed on a grouping of processors. One of the NP-hard problem is “Job Shop Scheduling Problem”. In this work, a method of optimization proposed called “Fireworks Algorithm”. The solutions divided into fireworks and each one applied sparks to find the best solution. For some selected spark applied Gaussian mutation to find enhanced solution and find optimum solution. FWA tested on dataset to improve performance and it do well with respect to some other algorithm like Meerkat Clan Algorithm (MCA), Camel Herds Algorithm) CHA (, and Cukoo Search Algorithm (CSA).