A hybrid discrete firefly algorithm for multi-objective flexible job shop scheduling problem with limited resource constraints

作者：Karthikeyan S^*; Asokan P; Nickolas S

来源：International Journal of Advanced Manufacturing Technology, 2014, 72(9-12): 1567-1579.

DOI：10.1007/s00170-014-5753-3

• Flexible job shop scheduling
• Hybrid discrete firefly algorithm
• Multi-objective optimisation
• Limited resource constraints
• Local search

In this paper, a hybrid discrete firefly algorithm is presented to solve the multi-objective flexible job shop scheduling problem with limited resource constraints. The main constraint of this scheduling problem is that each operation of a job must follow a process sequence and each operation must be processed on an assigned machine. These constraints are used to balance between the resource limitation and machine flexibility. Three minimisation objectives-the maximum completion time, the workload of the critical machine and the total workload of all machines-are considered simultaneously. In this study, 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. Meanwhile, local search method with neighbourhood structures is hybridised to enhance the exploitation capability. Benchmark problems are used to evaluate and study the performance of the proposed algorithm. The computational result shows that the proposed algorithm produced better results than other authors' algorithms.

• 出版日期2014-6