查詢結果分析
來源資料
頁籤選單縮合
題名 | 大專院校排課自動化之研究=On the Computing University Timetable Issues |
---|---|
作者 | 包冬意; 賴永進; 吳智暉; |
期刊 | 大葉學報 |
出版日期 | 19931200 |
卷期 | 2:1 1993.12[民82.12] |
頁次 | 頁135-144 |
分類號 | 525.4 |
語文 | chi |
關鍵詞 | 限制滿足問題; 作業研究; 人工智慧; 產生、測試與除錯策略; 啟發式法則; 群體決策支援系統; Constraint satisfaction problem; Generate; Test and debug strategy; Heuristic rules; Group decision support system; |
中文摘要 | 在大專院校的校務行政電腦化諸多作業中,教務處裡的課務系統有其複雜不易處理的一面,其中又以排課系統最為困難。究其原因,排課作業是一個多重限制滿足的問題;必須仰賴先期作業得到近乎滿足所有限制的可行解後,再經由協商方式得到大家均同意的科目時間表。然而無論是往年作業研究取向的排課自動化,或是近年來人工智慧、專家系統取向的方式,都只在探討先期排課電腦化,忽略了協商作業電腦化的可行性,無形中降低了使用者利用電腦排課的意願,最後甚至導致排課系統被擱置不用,造成校務行政電腦化的一大缺失。本文旨在陳述我們提議的排課系統架構設計一簡單的啟發式法則來指引產生、測試與除錯策略能有效地執行排課先期作業,並且界定排課協商群體決策支援電腦化環境的主要模組與功能,用來改進以往提議方法的不足。 |
英文摘要 | Computing university timetable is very hard. Timetabling is basically a multiple constraint satisfaction problem. However, the conventional approaches, i.e. purely operations research oriented and AI/expert system oriented could not completely solve this kind of problem. In reality, all of them did not take into account the fact that the final solution to the bling issues heavily depends on the negotiation activities between concerned parties. This paper proposes a general architecture for computing university timetable. Some simple heuristic rules can guide “generate, test and debug” strategy to preschedule courses as many as possible; a group decision support system is incorporated to ease the inherent negotiation activities required for the timetabling issues |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。