Performance Evaluation of Job Shop Scheduling Problem Using Proposed Hybrid of Black Hole and Firefly Algorithms

Scheduling issues have become a prominent region of research in previous decades. It has drawn the attention of many academics and engineers due to its versatility and importance in the fields of various real-world issues. Job shop scheduling problem (JSSP) is a booming topic of the scheduling research area. It has shown a deep enhancement in the form of cost minimization, time reduction to complete the job, to maintain proper allocation of jobs so that job potential can be increased. In this research article, the hybrid of black hole and firefly algorithm has been used for the solution of JSSP to get the combination of exploitation features of black hole and exploration quality of firefly algorithm for the purpose of getting better results. We have created 12 randomly generated problems to check the performance of the hybrid algorithm on the scheduling issues. The obtained computational results have been compared with standard PSO, FA, and SFLA. The proposed algorithm HBFA has proven to be the best algorithm among all these algorithms.