Skip to content

Latest commit

 

History

History
14 lines (9 loc) · 936 Bytes

README.md

File metadata and controls

14 lines (9 loc) · 936 Bytes

Job Shop Scheduling Problem

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.

Results

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).