Welcome to JSSP’s Documentation!

JSSP is an optimization package for the Job Shop Schedule Problem.
For more information on the specific job shop schedule problem JSSP was designed to solve see the Problem Description page.

JSSP has two different optimization algorithms:

  1. Parallel Tabu Search
  2. Genetic Algorithm


  1. Find near optimal solutions to flexible job shop schedule problems with sequence dependency setup times.
  2. Use of Cython C extensions for fast execution of code.
  3. Plot tabu search and/or genetic algorithm optimization using plotly.
  4. Create gantt charts using plotly.
  5. Create production schedule excel file.

Indices and Tables