Combining CA and PSO to Solve Flexible Job shop Scheduling Problem
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.
cultural algorithm particle swarm optimization algorithm flexible job shop scheduling problem makespan
ZHOU Wei BU Yan-Ping ZHOU Ye-qing
School of Business,East China University of Science and Technology,Shanghai,200237 School of Technology,Shanghai Jiaotong University,Shanghai,201101 School of Mathematical sciences,Fudan University,Shanghai,200433
国际会议
长沙
英文
1031-1036
2014-05-31（万方平台首次上网日期，不代表论文的发表时间）