A hybrid discrete particle swarm optimization algorithm for solving fuzzy job shop scheduling problem

Abstract

In this paper, a hybrid algorithm combining particle swarm optimization (PSO) and tabu search (TS) is proposed to solve the job shop scheduling problem with fuzzy processing time. The object is to minimize the maximum fuzzy completion time, i.e., the fuzzy makespan. In the proposed algorithm, PSO performs the global search, i.e., the exploration phase, while TS conducts the local search, i.e., the exploitation process. The global best particle is used to direct other particles to optimal search space. Therefore, in the proposed algorithm, TS-based local search approach is applied to the global best particle to conduct find-grained exploitation. In order to share information among particles, one-point crossover operator is embedded in the hybrid algorithm. The proposed algorithm is tested on sets of the well-known benchmark instances. Through the analysis of experimental results, the highly effective performance of the proposed algorithm is shown against the best performing algorithms from the literature.