文献类型：会议论文

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

作者：Zhou Wei[1];Bu Yan-ping;Zhou Ye-qing

机构：[1]E China Univ Sci & Technol, Sch Business, Shanghai 200237, Peoples R China

会议论文集：26th Chinese Control and Decision Conference (CCDC)

会议日期：MAY 31-JUN 02, 2014

会议地点：Changsha, PEOPLES R CHINA

语种：英文

外文关键词：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.