About

We consider the discrete, single-machine, multi-item, single-level lot sizing problem. The problem is solved via a graph algorithmic approach based on inspecting directed cycles in a residual graph which represents feasible schedules.

An outline of the approach can be found in doc/graph-optimisation.pdf.

Further information is also available at OptimizationHub

Folders

algorithm - part of Java implementation

doc - contains further documentation

graph - part of Java implementation

input - part of Java implementation

instances - contains instance files

runner - part of Java implementation

visualisation - part of Java implementation

Compilation & Execution

1. mvn package
2. java -jar runner/target/graph-opt-jar-with-dependencies.jar problem_instance

• To see all available command line arguments execute: java -jar runner/target/graph-opt-jar-with-dependencies.jar -h
• To change logging level to debug add -Dorg.slf4j.simpleLogger.defaultLogLevel=debug to java command.
• The default logging output target is System.err. To change the target add -Dorg.slf4j.simpleLogger.logFile=file to java command.

Authors

Sebastian Schenker