Benchmark version

This version introduces :

• Benchmark mode :

  • You can run multiple algorithms, defining a max matrix size, and number of runs. The benchmark will generate a random set of problems within the defined matrix size and compare results, runtime, and memory usage.

• Fixes :

  • Fixed 0 values causing solving errors.
  • Improved thread control code, solver now doesn't use the full CPU and threads will be killed on cancel.
  • Better memory managament and garbage collection.

Jar Instructions :

JavaFX is now packaged with the jar executable. Simply have any JRE higher than 9 to run it.
The windows executable is still packaged with Java 8 until issues with javafx-maven-compiler are solved.

Stable version 1.1.0

This version introduces :

• A quick solver algorithm for all 3 scheduling type, that can solve to a high level of accuracy for a minimum overhead.

• Greatly improved the speed of Open-shop exact solver by re-writing the algorithm.

• Added error UI display and fixed .jar from previous build.

Jar Instructions :

Since JavaFX 11 is unable to be included with the .jar package, to run it, it is necessary to have it downloaded.

Once you have it installed, on any OS, just run :

 java --module-path %JAVAFX_LIB_PATH% --add-modules javafx.controls,javafx.fxml -jar /path/to/this/jar.jar

The windows executable is standalone, but it is packaged with Java 8.

Initial build

This release has a single functional "Exact Solver" algorithm. Most combinations over 5 machines x 5 jobs will require a relatively high overhead, so kindly do not use large matrices with this version.

The next release will probably include a "Quick Solver", a non-exact heuristic for a more user-friendly software.