Using micro genetic algorithm for solving scheduling problems
Job Shop Scheduling Problem (JSSP) and Timetable scheduling are known to be computationally NP–hard problems. There have been many attempts by many researchers to develop reliable scheduling software, however, many of these software have only been tested or applied on an experimental basis or on a s...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 语言: | English |
| 出版: |
2005
|
| 主题: | |
| 在线阅读: | http://eprints.utm.my/id/eprint/35024/1/TayChengSan%20MFKE2005.pdf |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|