A hybrid parallel genetic algorithm for solving job-shop scheduling problems
The effort of searching an optimal solution for scheduling problems is important for real-world industrial applications especially for mission-time critical systems. In such an environment, an optimal result should be obtained within a relatively reasonable time. Genetic algorithms (GA) have long be...
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | أطروحة |
| اللغة: | الإنجليزية |
| منشور في: |
2005
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://eprints.utm.my/34719/1/GanTeckHuiMFKE2005.pdf |