A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system

2020 ◽  
Author(s):  
Nicolás Álvarez-Gil ◽  
Rafael Rosillo ◽  
David de la Fuente ◽  
Raúl Pino
Keyword(s):  
Firefly Algorithm ◽  
Manufacturing System ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Flexible Job Shop ◽  
Flexible Job Shop Scheduling ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Make To Order ◽  
Discrete Firefly Algorithm

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

2014 ◽  
Vol 575 ◽  
pp. 922-925 ◽  
Author(s):  
S. Karthikeyan ◽  
P. Asokan ◽  
M. Chandrasekaran
Keyword(s):  
Firefly Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Flexible Job Shop ◽  
Flexible Job Shop Scheduling ◽  
Maintenance Activity ◽  
Shop Scheduling ◽  
Multi Objective ◽  
Availability Constraints ◽  
Discrete Firefly Algorithm

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 / Sign up

Export Citation Format

Share Document