Genetic Algorithms for Flexible Job Shop Scheduling
A Python implementation of Genetic Algorithms for the NP-hard Flexible Job Shop Scheduling Problem (FJSP), comparing multiple GA variants (initialization, selection, crossover, mutation) and evaluating them on benchmark instances.