An approach of a Lampyridae family (firefly) algorithm for optimisation of Bagchi's job shop scheduling problems

Today, every organisation finds it a great challenge to fulfil the needs of its customers. In order to gratify their requirements of its clients. It is imperative for the organisations to integrate product design and development. In this process, scheduling plays a vital role. Scheduling problems can be solved using traditional methods in general and also involves huge computational difficulty and time consuming. From the literature review, it is inferred that by using traditional methods involves a huge difficulty in solving high complex problems and metaheuristic algorithms were proved to be most efficient algorithms to solve various job shop scheduling problems. The objective of this paper is to apply a recently developed metaheuristic algorithm also known as fire-fly algorithm to find optimal makespan and mean flow time of different size problems using to Bagchi job shop scheduling problems called JSP1 and JSP2 and also to prove that a proposed algorithm serves a good problem solving technique for JSSP with multi criteria.