文献类型：会议论文

中文题名：Combining CA and PSO to Solve Flexible Job shop Scheduling Problem

作者：ZHOU Wei;BU Yan-Ping;ZHOU Ye-qing

机构：[1]School of Business,East China University of Science and Technology,Shanghai,200237;[2]School of Technology,Shanghai Jiaotong University,Shanghai,201101;[3]School of Mathematical sciences,Fudan University,Shanghai,200433;

会议论文集：第26届中国控制与决策会议(2014 CCDC)论文集

会议日期：20140531

会议地点：长沙

主办单位：中国航空学会;中国自动化学会;中国人工智能学会;中国系统仿真学会

语种：英文

中文关键词：cultural algorithm;particle swarm optimization algorithm;flexible job shop scheduling problem;makespan

摘要：The flexible job shop scheduling problem(FJSP)is an extension of the classic job shop scheduling problem(JSP),which breaks through the uniqueness of limit resources,allows a procedure in many machines processing and one machine processing many kinds of different types of procedures.It is more practical and complex than JSP.The computational complexity of FJSP is much higher,which disables exact solution methods and makes heuristic approaches more qualified.A hybrid optimization algorithm,CPSO,based on the cultural algorithm and particle swarm optimization algorithm,is proposed in this paper to solve the FJSP.The objective is to minimize makespan.Computational results show that this hybrid method is able to solve efficiently these kinds of problems.