Optimization of Multi Objective Job Shop Scheduling Problems Using Firefly Algorithm
- 1 July 2014
- journal article
- Published by Trans Tech Publications, Ltd. in Applied Mechanics and Materials
- Vol. 591, 157-162
Abstract
Scheduling is the allocation of resources over time to carry out a collection of tasks assigned in any field of engineering and non engineering. Majority of JSSP are categorized into non deterministic (NP) hard problem because of its complexity. Scheduling are generally solved by using heuristics to obtain optimal or near optimal solutions because problems found in practical applications cannot be solved to optimality using available resources in many cases. Many researchers attempted to solve the problem by applying various optimization techniques. While using traditional methods they observed huge difficulty in solving high complex problems and meta-heuristic algorithms were proved most efficient algorithms to solve various JSSP so far. The objective of this paper i) to make use of a newly developed meta heuristic called Firefly algorithm (FA) because of inspiration on Firefly and its characteristic. ii) To find the combined objective function by determining optimal make span, mean flow time and tardiness of different size problems (using Lawrence 1-40 problems) as a bench marking dataset and to find the actual computational time. Iii) to prove that the proposed FFA algorithm is a good problem solving technique for JSSP with multi criteria.Keywords
This publication has 11 references indexed in Scilit:
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjectiveComputers & Operations Research, 2011
- A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problemsInternational Journal of Industrial Engineering Computations, 2010
- An efficient job-shop scheduling algorithm based on particle swarm optimization☆Expert Systems with Applications, 2010
- A new neighborhood and tabu search for the Blocking Job ShopDiscrete Applied Mathematics, 2009
- Firefly Algorithms for Multimodal Optimization2009
- Lagrangian bounds for just-in-time job-shop schedulingComputers & Operations Research, 2008
- A branch and bound method for the job-shop problem with sequence-dependent setup timesAnnals of Operations Research, 2007
- An Evolutionary Approach for Solving the Multi-Objective Job-Shop Scheduling Problem2007
- Multiobjective Scheduling by Genetic Algorithms1999
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990