A Hybrid Discrete Firefly Algorithm for Multi-Objective Flexible Job Shop Scheduling Problems with Maintenance Activity

A Hybrid Discrete Firefly Algorithm for Multi-Objective Flexible Job Shop Scheduling Problems with Maintenance Activity S. Karthikeyan NIT P. Asokan NIT M. Chandrasekaran Vels University

This paper presents a novel hybrid discrete firefly algorithm (HDFA) for solving the multi-objective flexible job shop scheduling problem with non fixed availability constraints (FJSP-nfa) due to maintenance activity. Three minimization objectives-the maximum completion time, the workload of the critical machine and the total workload of all machines are considered simultaneously. In this study, the discrete firefly algorithm is adopted to solve the problem, in which the machine assignment and operation sequence are processed by constructing a suitable conversion of the continuous functions as attractiveness, distance and movement, into new discrete functions. In addition the decoding mechanism considering the maintenance activity is presented. A neighbourhood based local search is hybridized to enhance the exploitation capability. Representative benchmark problems are solved in order to evaluate and study the performance of the proposed algorithm.
6 2014 922 925 https://www.scientific.net/PolicyAndEthics/PublishingPolicies https://www.scientific.net/license/TDM_Licenser.pdf 10.4028/www.scientific.net/AMM.575.922 https://www.scientific.net/AMM.575.922 https://www.scientific.net/AMM.575.922.pdf J. Gao, M. Gen, L. Sun, Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm, Journal of Intelligent Manufacturing, 17 (4) (2006) 493-507. 10.1007/s10845-005-0021-x S.J. Wang, J.B. Yu, An effective heuristic for flexible job-shop scheduling problem with maintenance activities, Computers and Industrial Engineering, 59 (3) (2010) 436-447. 10.1016/j.cie.2010.05.016 M. Rajkumar, P. Asokan,V. Vamsikrishna, A GRASP algorithm for flexible job-shop scheduling with maintenance constraints, Int. J. of Production Research, 48 (22) (2010) 6821-6836. 10.1080/00207540903308969 J.Q. Li, Q. K. Pan, Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity, Applied Soft Computing, 12 (9) (2012) 2896-2912. 10.1016/j.asoc.2012.04.012 X. S. Yang, Nature-inspired Metaheuristic Algorithm, second ed., Luniver Press, (2010). S. Lukasik, S. Zak, Firefly algorithm for continuous constrained optimization tasks, In Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems, Springer Berlin Heidelberg, (2009) 97-106. 10.1007/978-3-642-04441-0_8 M. Sayadi, Reza Ramezanian, Nader Ghaffari-Nasab, A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems, International Journal of Industrial Engineering Computations, 1 (2010). 10.5267/j.ijiec.2010.01.001 F. Pezzella, G. Morganti, G. Ciaschetti, A genetic algorithm for the flexible job-shop scheduling problem, Computers & Operations Research, 35 (10) (2008) 3202-3212. 10.1016/j.cor.2007.02.014 J. Li, Q. Pan, S. Xie, An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems, App. Mathematics and Computation, 218 (18) (2012) 9353-9371. 10.1016/j.amc.2012.03.018 P. Brandimarte, Routing and Scheduling in a flexible job shop by tabu search, Annals of Operations Research, 41 (1993) 157-183. 10.1007/bf02023073 C. Zhang, P. Li, Z. Guan, Y. Rao, A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem, Computers & Operations Research, 34 (11) (2007) 3229-3242. 10.1016/j.cor.2005.12.002