期刊文献+

浅谈贪心算法在排课系统中的应用 被引量:3

Greedy Algorithm Scheduling System Research
在线阅读 下载PDF
导出
摘要 课程表的编排是高校教务管理中最重要、最复杂的工作,本文通过对排课过程中可能出现的问题进行了阐述,分析了贪心算法如何解决排课问题,并且文章给出了基于贪心算法的排课系统算法的实现过程。 Curriculum is organized Educational Administration,the most important and most complex work,this paper process Scheduling problems that may occur are described,analyzed the greedy algorithm to solve the problem of arranging schedule,and the article gives the Scheduling System algorithm implementation process.
作者 邓曦辉
出处 《电脑与电信》 2011年第7期29-30,共2页 Computer & Telecommunication
关键词 贪心算法 排课系统 人机交互环境 Greedy algorithm Scheduling System interactive environment
作者简介 邓曦辉,男,山西平遥人,研究生,讲师,研究方向:计算机应用技术。
  • 相关文献

参考文献3

二级参考文献12

  • 1郑琦,李兰友.PowerBuilder中数据窗口的使用技巧[J].微计算机信息,2004,20(9):125-125. 被引量:7
  • 2Selim,SM. An Algorithm for Constructing a University Faculty Timetable. Comput. Edu.,1982, 6:323-332
  • 3Selim,SM. An Algorithm for Producing Course and Lecture Timetable. Comput. Edue., 1983,6:323-332
  • 4Loo,E.H. Goh,T,N. and Ong, H.L.. A Heuristic Approach to Scheduling University Timetahles.. Comput. Edu. 1986,10 (3) : 397-388
  • 5Danny Kalev.使用<multimap>库创建重复键关联容器.http://www.vckbase.com/document/viewdoc/?id=1398.2006
  • 6刘时渊.电脑在排课作业上的应用-问题的性质与几个系统的作法[J].资讯与教育杂志,1993,(4).
  • 7WREN A.Scheduling,timetabling,and rostering-a special relationship?[C]//BURKE K,ROSS P.LNCS 1153,Berlin:Springer,1995:46-75.
  • 8GAREY M R,JOHNSON D S.Computers and intractability-a guid to the theory of NP-completeness[M].San Francisco:W.H.Freeman and Company,1979.
  • 9ABDULLAH S.Heuristic approaches for university timetabling problems[D].Nottingham,UK:University of Nottingham,2006.
  • 10SCHAERF A.Local search techniques for large high-school timetabling problems[J].IEEE Transactions on Systems,Man,and Cybernetics Part A:Systems and Humans,1999,29(4):368-377.

共引文献42

同被引文献16

  • 1程学先,祝苏薇.一种基于动态规划的课程调度算法的研究与实现[J].武汉理工大学学报(交通科学与工程版),2006,30(3):485-488. 被引量:8
  • 2车明,秦存秀,刘凯.基于改进回溯算法的计算机排课系统[J].沈阳工业大学学报,2006,28(6):667-670. 被引量:12
  • 3谢红标,徐争前.基于Web的智能化宿舍管理系统的设计与实现[J].计算机时代,2007(6):47-48. 被引量:13
  • 4ADEWUMI A O, SAWYERR B A, MONTAZ A M. A heuristic so- lution to the university timetabling problem [ J]. Engineering Com- putations, 2009, 26(8): 972-984.
  • 5EVEN S, ITAI A, SHAMIR A. On the complexity of time table and multi-commodity flow problems [ J]. SIAM Journal on Computing, 1976, 5(4): 691-703.
  • 6SELIM S M. Split vertices in vertex colouring and their application in developing a solution to the faculty timetable problem [ J]. The Computer Journal, 1988, 31 (1) : 76 - 82.
  • 7KENNEDY J, EBERHART R C. Particle swarm optimization [ C]// Proceedings of IEEE International Conference on Neutral Networks. Piscataway: IEEE Press, 1995:1942-1948.
  • 8KENNEDY J, EBERHART R C. A discrete binary version of the particle swarm algorithm [ C]//Proceedings of the IEEE Internation- al Conference on Systems, Man and Cybernetics. Piscataway: IEEE Press, 1997:4104-4108.
  • 9WANG K P, HUANG L, ZHOU C G, et al. Particle swarm optimi- zation for traveling salesman problem [ C]//Proceedings of the IEEE International Conference on Machine Learning and Cybernetics. Pis- cataway: IEEE Press, 2003:1583-1585.
  • 10SHI X H, XING X L, WANG Q X, et al. A discrete PSO method for generalized TSP problem [ C]//Proceedings of the Third Interna- tional Conference on Machine Learning and Cybernetics. Piscat- away: IEEE Press, 2004:2378-2383.

引证文献3

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部