Using the Memetic Algorithm for Multi Objective Job Shop Scheduling Problems
The multi objective job shop scheduling problem is well known as one of the most complex optimization problems due to its very large search space and many constraint between machines and jobs. In this paper, an evolutionary approach of the memetic algorithm is used to solve the multi objective job shop scheduling problems. Memetic algorithm is a hybrid evolutionary algorithm that combines the global search strategy and local search strategy. The objectives of minimizing makespan and mean flow time are considered while satisfying a number of hard constraints. The computational results demonstrate the proposed MA is significantly superior to the other reported approaches in the literature.
Job shop scheduling Memetic algorithm Local search Multi objective
Guohui Zhang
Zhengzhou Institute of Aeronautical Industry Management, Zhengzhou, 450015, China
国际会议
武汉
英文
245-250
2012-07-29（万方平台首次上网日期，不代表论文的发表时间）