Solving flexible job-shop scheduling problem using hybrid particle swarm optimisation algorithm and data mining

摘要

Flexible job-shop scheduling problem (FJSSP) is an extension of the classical job-shop scheduling problem that allows an operation to be processed by any machine from a given set along different routes. It is very important in both fields of production management and combinatorial optimisation. This paper presents a new approach based on a hybridisation of the particle swarm optimisation (PSO) algorithm with data mining (DM) technique to solve the multi-objective flexible job-shop scheduling problem. Three minimisation objectives - the maximum completion time, the total workload of machines and the workload of the critical machines are considered simultaneously. In this study, PSO is used to assign operations and to determine the processing order of jobs on machines. The objectives are optimised by data mining technique which extracts the knowledge from the solution sets to find the near optimal solution of combinatorial optimisation problems. The computational results have shown that the proposed method is a feasible and effective approach for the multi-objective flexible job-shop scheduling problems.