Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
