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
格式:	Thesis
語言:	英语
出版:	2005
主題:	Unspecified
在線閱讀:	http://eprints.utm.my/35024/1/TayChengSan%20MFKE2005.pdf