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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | أطروحة |
| منشور في: |
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/ |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|