none
碩士 === 國立成功大學 === 工業管理科學系專班 === 92 === Schedule-arranging is a very complicated schedule problem. It also a NP-Complete (Non-deterministic Polynomial Time) problem. So far, the NP-Complete is a function is a kind of exponential function which is best way to solve multiple restrictions, including...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/vruhv7 |