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...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Published: |
2005.
|
| Subjects: | |
| Online Access: | Get fulltext |