计算机应用研究2012，Vol.29Issue(12)：4451-4454,4.DOI:10.3969/j.issn.1001-3695.2012.12.011
求解高校教室调度问题的混合粒子群算法
Solving for timetabling problem in universities based on hybrid particle swarm optimization
摘要
Abstract
The timetabling problem in universities is to assign the courses into classrooms. Taking the classrooms' utilization and students' requirements into consideration, job denoted course and machine denoting the different types of classrooms by a triplet. Thus, the parallel machine scheduling with the machine eligibility restrictions could represent the classroom curriculum problem. Its ultimate objective was minimizing Cmax and the sum of tardiness. Then, it proposed the corresponding operational scheduling model on the basis of analyzing the problem' s features. And it applied hybrid particle swarm optimization ( HPSO) algorithm to solve this problem. In the end,results show that HPSO maks the two objectives come true. It tested the feasibility of proposed algorithm by comparing the results of HPSO with that of other algorithms.关键词
高校教室调度/三元组/并行机调度/运筹学模型/混合粒子群算法Key words
timetabling in universities/ triplet/ parallel machine scheduling/ operational model/ hybrid particle swarm optimization分类
信息技术与安全科学引用本文复制引用
曹策俊,杨琴,李从东..求解高校教室调度问题的混合粒子群算法[J].计算机应用研究,2012,29(12):4451-4454,4.基金项目
国家自然科学基金资助项目(70672013) （70672013）
四川省哲学社会科学"十二五"规划项目(SC11C042) （SC11C042）
四川省教育厅科研资助项目(10ZC004) （10ZC004）
暨南大学优秀本科推免生科研创新培育计划资助课题 （）
