Optimal fördelning av anställningsformer på SJ : Ett planeringsprogram baserat på villkorsprogrammering och kända schemakäggningsproblem

Sammanfattning: A big challenge for many companies, road haulers business among others, is how to make a schedule for all employees. Scheduling problems handles a big number of constraints which also increase the complexity of the problem.   It is important to SJ that all train departures are staffed. SJ offers both permanent and temporary employments but during recruitment in connection to the summer they only hire temporary employees. It often happens that SJ hires a larger number of workers than needed, and as a consequence of this some of the employees does not get to work the number of hours the wishes and they might turn to other employers. Temporary employments can result in uncertainty for SJ as they can choose when to work. Due to this, SJ now wants to examine the possibility to hire permanent employees during the summer and they also want to examine how the distribution of employments should look like for different stations and time periods.   Important constraints for scheduling and planning have been identified and formulated, and these have formed the basis to the optimization problem that is indented to be solved. A scheduling tool, EAPS, has been developed and with help from this minimal staff set and employment arrangements for boarders can be identified. EAPS ensure that each worker is free every other weekend, that no worker is assigned more shifts than allowed for the analyzed period and that they do not work more shifts in a row than allowed. EAPS ensure that all departures are covered by boarders at the same time as the number of workers are minimized.