Artelys Kalis 12.8: Solve your biggest Job shop problems!

Main new features

This new version makes it easier to solve job-shop problems (JSP). Artelys Kalis improves the modeling and resolution of optimization problems in IT and operations research where jobs have to be scheduled and assigned to resources .

On the modelling side, the user is now able to define a set-up time between two tasks requiring the same resource. For example, it is now easy to model a scheduling problem where the maintenance tasks are to be performed in different places meaning the skilled technicians required for these tasks must travel between these places.

On the resolution side, the Timetable algorithm, used for the propagation of the resource constraints for the tasks, has been vastly improved, notably for the alternative resources. As a result, the performance of Artelys Kalis has vastly improved. For example, in the case of a scheduling problem with up to 250 alternative resources as a function of the number of tasks planned, the computation time reduces as shown below:

Other new features of Artelys Kalis 12.8: