Skip to content

Models the discrete, single-machine, multi-item, single-level lot sizing problem via mixed integer programming

License

Notifications You must be signed in to change notification settings

asbestian/lot_sizing

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

CI

About

This repository implements different mixed integer programming (mip) formulations for the discrete, single-machine, multi-item, single-level lot sizing problem.

A mathematical description of those mip formulations is available in mip_formulations.pdf in the doc folder.

Further information is also available at OptimizationHub.

Installation

Source code requires python3.8 (or later versions).

In root directory: python3 -m pip install -r requirements.txt

Execution

In root directory: python3 main.py -f input_file.txt

Run python3 main.py -h in order to see all command line options.

Unit tests

In root directory: python3 -m unittest discover test -v

Documentation

In doc directory: make html

The html documentation can then be found in doc/build/html.

Authors

Sebastian Schenker

About

Models the discrete, single-machine, multi-item, single-level lot sizing problem via mixed integer programming

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages