政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/67156

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/67156

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文筆數/總筆數 : 113656/144643 (79%)
造訪人次 : 51759856 線上人數 : 588

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

搜尋範圍

查詢小技巧：

您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果

若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料

進階搜尋

主頁 ‧ 登入 ‧ 上傳 ‧ 說明 ‧ 關於政大典藏 ‧ 管理

到手機版

政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 > Item 140.119/67156

請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/67156

題名:	應用於大學科系的一套課程排課優化系統 An optimizable timetabling system for the department courses of university
作者:	鄭俞佑 Cheng, Yu You
貢獻者:	陳正佳 Chen, Cheng Chia 鄭俞佑 Cheng, Yu You
關鍵詞:	排課 TimeTabling
日期:	2013
上傳時間:	2014-07-01 12:14:46 (UTC+8)
摘要:	本研究目的，在於提供使用者一個前後端完整的大學課程排課系統。而我們的系統特點除了找出能符合所有條件的排課結果之外，更著重在教師個人喜好的滿足上面。舉凡是教師的課程時間或者是教室選擇喜好，都是我們在篩選排課結果的重要依據。除了一般常見的GUI使用者介面之外，本系統也同時引進領域專屬語言 (Domain Specific Language, DSL) 的概念，希望替排課系統擴充其實用性。當使用者輸入完整的排課相關資料之後，我們的系統最後將會從眾多的排課可能結果之中，挑出滿足最多教師喜好需求的課表提供使用者參考。在最後的結果顯示中，我們將提供給使用者多個不同的檢視角度。例如各系所的一週課程表、所有課程描述表、各教師的個別課程表，各教室的個別課程表等。另外，在GUI模式中，我們架設BaseX 的XML資料庫伺服器，使用者將他們設定好的課程資料放上伺服器後，外界就可以透過伺服器讀取關於課程編排的相關訊息。 This study provides a complete front and back end system for university course scheduling. This system can produce scheduling results that meet all specified conditions, while also satisfying the preferences of instructors such as class times or classroom requirements. In addition to a commonplace graphical user interface (GUI), this system also introduces Domain Specific Language (DSL) in order to increase its practicality. After the user inputs complete course scheduling-related information, the system identifies the scheduling options that meet the greatest number of instructor preferences and displays them for the user. The system will eventually provide the user with a number of different views, such as a weekly schedule for all programs, all course descriptions, the course schedules for individual instructors, and the course schedules for individual classrooms. In addition, the GUI mode incorporates a BaseX XML database server onto which users can upload course data, enabling other individuals to obtain information on information related to course scheduling.
參考文獻:	[1] School 課表. (2011) From http://en.wikipedia.org/wiki/School_課表. [2] Groovy Builders. Retrieved March, (2012). From http://groovy.codehaus.org/Builders. [3] JaCop. (2003) From http://bach.istc.kobe-u.ac.jp/JaCop/. [4] @ONE爸爸的隨想手札. (2007) From http://aone.blog.ithome.com.tw/post/284/9782. [5] Venkat Subramaniam. (2008) Programming Groovy: Dynamic Productivity for the Java Developer. The Pragmatic Bookshelf. [6] Fergal Dearle. (2010) Groovy for Domain-Specific Languages. Packt publishing. [7] Dierk Konig. (2007) Groovy in Action. Manning Publications Co. [8] Constraint satisfaction problem. Retrieved (2012) From http://en.wikipedia.org/wiki/Constraint_satisfaction_problem [9] Schaerf A (1995). “A survey of automated timetabling”. Artificial Intelligence Review, vol.13, pp.87-127. [10] Carter M. W., Laprorte G (1998). “Recent Developments in Practical Course timetabling”. In[11] pp.3-19. [11] Burke E. K., Carter M. (Eds.) (2000). The Practice and Theory of Automated timetabling [12] Carter M. W., Laprorte G (1998). “Recent Developments in Practical Course Timetabling”. In[11] pp.3-19.. [13] Even S., Itai, A. and Shamir, A. (1975). “On the Complesity of 課表 and Multi-commodity Flow Problem”, 16th IEEE Annual Symposium on foundations of Computer Science, pp. 184-193 [14] 謝昆霖，沈進成，周君妍，鄭丞君(2004)。基因演算法應用於顧客旅遊行程路徑最適化模式之研究。旅遊管理研究，第四卷，第一期，頁53-66。 [15] 陳奕憲(2011)。基因演算法在國民中學排課問題之最佳化研究。南華大學資訊管理學系，碩士論文。 [16] A. Schaerf (1996). Tabu search techniques for large high-school timetabling problems. In Proc. of AAAI-96, pp. 363–368. AAAI Press/MIT Press [17] T. Duong (2004). Combining constraint programming and simulated annealing on university exam timetabling, Research Informatics Vietnam and Francophone, pp. 205–210. [18] H. Asmuni, E.K. Burke and J. Garibaldi (2005). Fuzzy multiple ordering criteriafor examination timetabling [19] Borning A., Duisberg R., Freeman Benson B., Kramer A., Woolf M.. (1987). Constraint Hierarchies. Proceedings of the 1987 ACM Conference on Object Oriented Programming Systems, Languagesand Applications. Pp. 48-60 [20] Freuder E. C., Wallace R. J.. (1992). Partial Constraint Satisfaction. Artifical Intelligence [21] Bluenight專欄. Retrieved July (2012). From http://blog.csdn.net/chl033/article/details/4020334. [22] Groovy Home Page. Retrieved April (2014). From http://groovy.codehaus.org/ [23] Domain Specific Language. Retrieved April (2014). From http://en.wikipedia.org/wiki/Domain-specific_language [24] International Timetabling Competition Retrieved April (2014). From http://www.cs.qub.ac.uk/itc2007/ [25] JavaFX: Getting Started with JavaFX Retrieved April (2014). From http://docs.oracle.com/javase/8/javafx/get-started-tutorial/jfx-overview.htm#JFXST784 [26] MetaObject Protocol Retrieved April (2014). From http://en.wikipedia.org/wiki/Metaobject [27] MeteProgramming Retrieved April (2014). From http://en.wikipedia.org/wiki/Metaprogramming [28] Curriculum-Based Course TimeTabling Retrieved April (2014). From http://tabu.diegm.uniud.it/ctt/index.php [29] Constraint Programming Retrieved May (2014). From http://en.wikipedia.org/wiki/Constraint_programming [30] CTT EA08 Example Retrieved April (2014). From http://tabu.diegm.uniud.it/ctt/index.php?page=stats&name=EA08 [31] 王子夏(2007)。應用基因演算法於大專院校教師派課問題之研究。崑山科技大學資訊管理系，2007年資訊科技國際研討會論文集。 [32] MBAlib, Retrieved (2012) From http://wiki.mbalib.com/zh-tw/%E6%A8%A1%E7%B3%8A%E6%8E%A7%E5%88%B6 [33] MBAlib, Retrieved (2012) From http://wiki.mbalib.com/zh-tw/%E7%A6%81%E5%BF%8C%E6%90%9C%E7%B4%A2%E7%AE%97%E6%B3%95 [34] 模擬退火法, Retrieved (2012) From http://jjcommons.csie.isu.edu.tw/research/download/SA.pdf [35] Guide to Constraint Programming. (1998) From http://ktiml.mff.cuni.cz/~bartak/constraints/pcsp.html. [36] Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., and Teller, E., “Equation of state calculations for fast computing machines,” Journal of Chemical Physics, Vol. 21, pp. 1087-1092, 1953.
描述:	碩士國立政治大學資訊科學學系 98753021 102
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G0987530213
資料類型:	thesis
顯示於類別:	[資訊科學系] 學位論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
021301.pdf	2001Kb	Adobe PDF2	729	檢視/開啟

在政大典藏中所有的資料項目都受到原著作權保護.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - 回饋