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

Authors: Kuppuswamy Chockalingam Udaiyakumar; M. Chandrasekaran

Addresses: Department of Mechanical Engineering, Sathyabama University, Chennai – 119, India ' Department of Mechanical Engineering, Vels University, Chennai – 117, India

Abstract: 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.

Keywords: job shop scheduling problem; JSSP; firefly algorithm; makespan; mean flow time; benchmarking.

DOI: 10.1504/IJENM.2015.073872

International Journal of Enterprise Network Management, 2015 Vol.6 No.4, pp.324 - 339

Received: 07 Oct 2014
Accepted: 08 Dec 2014
Published online: 27 Dec 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article