Home

Welcome to the jobshop-minimal wiki!

This tool uses a heuristic based approach to solve the jobshop scheduling problem. The primary goal is minimizing tardiness of demand.

Supported functionality includes:

• Modeling demands with priority, due date, due quantity
• Task sequence required to meet demand for a SKU
• Task setup time and per unit cycle times
• Tasks can load alternate workcenters (with priority sequence)
• Workcenters can model holidays and efficiency (to stretch tasks)

Browse through the wiki to discover more details about this project.