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...

詳細記述

保存先:
書誌詳細
第一著者: Tay, Cheng San
フォーマット: 学位論文
言語:English
出版事項: 2005
主題:
オンライン・アクセス: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
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!

類似資料