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:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2005
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/35024/1/TayChengSan%20MFKE2005.pdf http://eprints.utm.my/id/eprint/35024/ http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:61288?queryType=vitalDismax&query=Using+micro+genetic+algorithm+for+solving+scheduling+problems&public=true |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|