Integer Programming for University Class Scheduling-Department of Industrial and Systems Engineering at CYCU as an Example
碩士 === 中原大學 === 工業與系統工程研究所 === 99 === University schedule arrangement for each semester is a routine operation. It is a quite time-consuming operation and also a very complex scheduling problem called a NP-complete (Non-deterministic Polynomial Time) problem. In this study, we developed an integer...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/21741516945990231845 |