An approach of a Lampyridae family (firefly) algorithm for optimisation of Bagchi's job shop scheduling problems
by Kuppuswamy Chockalingam Udaiyakumar; M. Chandrasekaran
International Journal of Enterprise Network Management (IJENM), Vol. 6, No. 4, 2015

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.

Online publication date: Sun, 27-Dec-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Enterprise Network Management (IJENM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com