Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin
Job Shop Scheduling Problem (JSSP) is one of the well-known hard combinatorial scheduling problems and one of the most computationally difficult combinatorial optimization problems considered to date. This intractability is one of the reasons why the problem has been so widely studied. The problem w...
Saved in:
主要作者: | Ong, Chung Sin |
---|---|
格式: | Thesis |
出版: |
2013
|
主題: | |
在線閱讀: | http://studentsrepo.um.edu.my/4177/1/ONG_CHUNG_SIN_SGP110004.pdf http://pendeta.um.edu.my/client/default/search/detailnonmodal/ent:$002f$002fSD_ILS$002f988$002fSD_ILS:988485/ada?qu=Hybrid+genetic+algorithm http://studentsrepo.um.edu.my/4177/ |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Solving a multi-objective job shop scheduling problem using a hybrid genetic algorithm
由: Piroozfard, Hamed
出版: (2013) -
Job shop scheduling problem (JSSP)
由: Abdullah, Nurul Azma
出版: (2004) -
Virtual brand personality, customer satisfaction and brand loyalty in online banking industry / Ong Khian Sin
由: Ong, Khian Sin
出版: (2009) -
A Modified Giffler and Thompson Genetic Algorithm on the Job
Shop Scheduling Problem
由: Lee, Hui Peng, et al.
出版: (2006) -
A hybrid parallel genetic algorithm for solving job-shop scheduling problems
由: Gan, Teck Hui
出版: (2005)