engleski

A Fast Genetic Algorithm Based on Single Gene Evaluation Fitness Mechanism for Job-Shop Scheduling Problem

The Job Shop Scheduling Problem (JSSP) is one of the most general and difficult of all traditional scheduling problems. Search based on traditional ghenetic algorithms has a major drawback: large computational time and memory usage if a large population and / or a large number of generations are used but on the other hand larger population and larger number of generations usualy provide better results. The goal of this research is to develop an efficient scheduling method based on genetic algorithm to address JSSP. In the scheduling method new crossover and selection method are tested. The results are compared with two other two similar and commonly used algorithms. Compared to traditional genetic algorithms, the proposed has significant improvements in solution quality and speed.

JSSP; job-shop scheduling; genetic algorithm; heuristics; fast genetic algorithm; single gene fitness; crossover operator

nije evidentirano