%0 Journal Article
%T Interactive timetabling approach based on greedy method and tabu search<br>基于贪心法和禁忌搜索的实用高校排课系统研究
%A WANG Wei
%A YU Li-hua
%A <br>王伟
%A 余利华
%J 计算机应用
%D 2007
%I 
%X University timetabling is a widely used NP hard optimization problem, hence finding a high quality timetable is a challenging work. The hard and soft constraints of university timetabling problem were analyzed, and then an interactive timetabling system based on greedy method and tabu search was proposed. Greedy method was used to construct an initial solution at the first phase and tabu search was used to find an optimal timetable at the second phase. The prototype is implemented and the experimental results show that the approach is both practical and efficient.
%K timetabling
%K priority
%K greedy method
%K tabu search<br>排课
%K 优先级
%K 贪心法
%K 禁忌搜索
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=65FF8E5AA903FB8623902AF977B26D17&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=708DD6B15D2464E8&sid=6462474D186F62A8&eid=38AE2999C563143A&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=6