Employee scheduling with SAT-based pseudo-boolean constraint solving
10.1109/ACCESS.2021.3120597
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/355638
Tipus de documentArticle
Data publicació2021
EditorInstitute of Electrical and Electronics Engineers (IEEE)
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement 4.0 Internacional
Abstract
The aim of this paper is practical: to show that, for at least one important real-world problem, modern SAT-based technology can beat the extremely mature branch-and-cut solving methods implemented in well-known state-of-the-art commercial solvers such as CPLEX or Gurobi. The problem of employee scheduling consists in assigning a work schedule to each of the employees of an organization, in such a way that demands are met, legal and contractual constraints are respected, and staff preferences are taken into account. This problem is typically handled by first modeling it as a 0-1 integer linear program (ILP). Our experimental setup considers as a case study the 0-1 ILPs obtained from the staff scheduling of a real-world car rental company, and carefully compares the performance of CPLEX and Gurobi with our own simple conflict-driven constraint-learning pseudo-Boolean solver.
CitacióNieuwenhuis, R. [et al.]. Employee scheduling with SAT-based pseudo-boolean constraint solving. "IEEE access", 2021, vol. 9, p. 142095-142104.
ISSN2169-3536
Versió de l'editorhttps://ieeexplore.ieee.org/document/9576062
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Employee_Schedu ... ean_Constraint_Solving.pdf | 890,9Kb | Visualitza/Obre |