This code attempts to minimize the makespan in a static Job Shop Scheduling Problem (JSSP) using Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO).
Some relevant papers:
Applying Ant Colony Optimization on dynamic JSSP
Investigation of Particle Swarm Optimization for JSSP
This code was written as part of a project at NTNU (Norwegian University of Science and Technology) for the course IT3708 Bio-Inspired Artificial Intelligence.
This code gets makespans within 10% of the benchmarks given in the testing ata. Depending on the problem, some parameter tuning can be required (see config).