Reševanje izmenskih urnikov z optimizacijskimi algoritmi

Bokal, Matej (author), Sadikov, Aleksander (mentor)

Reševanje izmenskih urnikov je kombinatoričen problem z omejitvami: uskladiti je treba povpraševanje, razpoložljivost, tipe zaposlitve in pravila lokacije. V nalogi problem formaliziramo kot CSOP z binarnimi spremenljivkami xs,e, trdimi omejitvami in uteženo ciljno funkcijo, ki dopušča delno pokritost. Na tej podlagi smo implementirali spletno aplikacijo (React, Django, CPMpy/OR-Tools CP-SAT) za urejanje matrice, zagona reševanja, diagnostike in objave urnika. Pilot v gostinskem podjetju je pokazal, da pristop znatno skrajša mesečno delo z urnikom.

• Language: Slovenian
• Keywords: CSP, CP-SAT, izmenski urniki, optimizacija
• Work type: Bachelor thesis/paper
• Organization: FRI - Faculty of Computer and Information Science
• Year: 2026
• PID: 20.500.12556/RUL-190446
• Publication date in RUL: 29.10.2026

Secondary language

• Language: English
• Title: Generating Shift Schedules with Optimisation Algorithms

Abstract

Shift scheduling is a combinatorial constrained problem: demand, availability, employment types and local rules must be aligned. We formalise it as a CSOP with binary variables xs,e, hard constraints and a weighted objective that allows partial coverage. We implemented a web application (React, Django, CPMpy/OR-Tools CP-SAT) for editing demand, running the solver, viewing diagnostics and publishing schedules. A hospitality pilot showed that the approach can greatly reduce monthly rostering effort.

• Keywords: CSP, CP-SAT, shift scheduling, optimization