Solving the University Course Scheduling Using Simulated Annealing Algorithm
碩士 === 育達商業技術學院 === 資訊管理所 === 92 === The school timetabling problem involves both NP-complete and combinatorial optimisation problems, hence it is quite difficult while seeking for solutions. Timetabling is now manually achieved in most schools, or, a general timetable is made and then amended by op...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/15084326866452672773 |