SiPS - Single-machine scheduling Problem Solver
SiPSi - Single-machine scheduling Problem Solver with idle time
SiPS/SiPSi is a powerful single-machine scheuling problem solver. Theoretically, it can handle general single-machine scheduling problems with the following properties:
no additional constraints (precedence constraints, sequence-dependent setup times and so on),
the objective function is the sum of job completion costs.
[TFA09] S. Tanaka, S. Fujikuma and M. Araki. An exact algorithm for single-machine scheduling without machine idle time. Journal of Scheduling 12(6), pp. 575-593, 2009. DOI: 10.1007/s10951-008-0093-5
[TF12] S. Tanaka and S. Fujikuma. A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time. Journal of Scheduling 15(3), pp. 347-361, 2012. DOI: 10.1007/s10951-011-0242-0
Reference manual [manual_v108p4.pdf]
Latest version is 1.08p4 [Changelog.txt]
Windows C source
Linux C source