Particle swarm optimization with variable neighborhood search for multiobjective flexible job shop scheduling problem  

作　　者：Song Huang Na Tian Zhicheng Ji 

机构地区：[1]School of Internet of Things Engineering Jiangnan University,1800 Lihu Avenue Wuxi,Jiangsu Province,214122,P.R.China [2]Key Laboratory of Advanced Process Control for Light Industry Ministry of Education,Jiangnan University Wuxi,214122,P.R.China

出　　处：《International Journal of Modeling, Simulation, and Scientific Computing》2016年第3期199-215,共17页建模、仿真和科学计算国际期刊（英文）

基　　金：supported in part by the National Natural Science Foundation of China(No.61174032);the Public Scientific Research Project of State Administration of Grain(No.201313012);the National Natural Science Foundation of China(Project No:61572238);the National High-tech Research and Development Projects of China(Project No:2014AA041505).

摘　　要：The simulation on benchmarks is a very simple and efficient method to evaluate the performance of the algorithm for solving flexible job shop scheduling model.Due to the assignment and scheduling decisions,flexible job shop scheduling problem(FJSP)becomes extremely hard to solve for production management.A discrete multi-objective particle swarm optimization(PSO)and simulated annealing(SA)algorithm with variable neighborhood search is developed for FJSP with three criteria:the makespan,the total workload and the critical machine workload.Firstly,a discrete PSO is designed and then SA algorithm performs variable neighborhood search integrating two neighborhoods on public critical block to enhance the search ability.Finally,the selection strategy of the personal-best individual and global-best individual from the external archive is developed in multi-objective optimization.Through the experimental simulation on matlab,the tests on Kacem instances,Brdata instances and BCdata instances show that the modified discrete multi-objective PSO algorithm is a promising and valid method for optimizing FJSP with three criteria.

关 键 词：Variable neighborhood search particle swarm optimization flexible job shop scheduling 

分 类 号：TP1[自动化与计算机技术—控制理论与控制工程]