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 |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
類似資料
-
A hybrid parallel genetic algorithm for solving job-shop scheduling problems
著者:: Gan, Teck Hui
出版事項: (2005) -
Solving the MASUM sport league scheduling problem using hybrid genetic algorithm and constraint-based reasoning
著者:: Abu Samah, Mazlan
出版事項: (2006) -
Using genetic algorithm with directed mutation in solving timetabling problems
著者:: Woo, Lai Leng
出版事項: (2005) -
A modified giffler and thompson genetic algorithm on job shop scheduling problem
著者:: Lee, Hui Peng
出版事項: (2005) -
Solving job shop scheduling problem by using tabu search method
著者:: Haron, Nur Fatihah
出版事項: (2012)