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:
主要作者: | Tay, Cheng San |
---|---|
格式: | Thesis |
語言: | English |
出版: |
2005
|
主題: | |
在線閱讀: | http://eprints.utm.my/id/eprint/35024/1/TayChengSan%20MFKE2005.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
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)