Solving flexible job shop scheduling using an effective memetic algorithm. (2016)

• Record Type: Journal Article
• Authors: Yi, Wenchao; Li, Xinyu; Pan, Baolin
• Is Part Of: International journal of computer applications technology. Volume 53:Number 2(2016)
• Page Start: 157
• Page End: 163
• Publication Date: 2016
• Subjects: memetic algorithms -- FJSP -- flexible job shop scheduling problem -- makespan minimisation -- tabu search -- genetic algorithms -- exploration -- exploitation -- local search -- global reaching; Technology -- Data processing -- Periodicals; 620.00285
• Languages: English
• ISSNs: 0952-8091

Abstract

This paper proposes an effective Memetic Algorithm (MA) for the Flexible Job Shop Scheduling Problem (FJSP) with the objective of minimising the makespan. The proposed MA is a combination of TABU Search (TS) and Genetic Algorithm (GA). This hybridisation presents an effective way of performing both exploration and exploitation by incorporating the local search abilities of TS with the global reaching capabilities of GA. The approach provides an effective encoding method, genetic operators and neighbourhood structure in order to effectively solve the FJSP. To evaluate the performance of the proposed MA, several benchmark instances of FJSP have been used. The experimental results show that the proposed MA is a very effective method for solving FJSP.