文献类型：期刊文献

英文题名：Combining CA and PSO to solve flexible job shop scheduling problem

作者：Zhou, Wei[1]; Bu, Yan-Ping[2]; Zhou, Ye-Qing[3]

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

年份：2014

起止页码：1031

外文期刊名：26th Chinese Control and Decision Conference, CCDC 2014

收录：EI(收录号：20143218039168)

语种：英文

外文关键词：Heuristic methods - Job shop scheduling

摘要：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. ? 2014 IEEE.