Aug 2026
On the Use of Regular Languages to Model Personnel Scheduling Problems
This paper formalizes four standard rules and shows how to obtain a deterministic finite automaton (DFA) representation for each of them, and introduces four specific operations on DFA and presents their practical computation.
Guillaume Ghienne, O. Bellenguez, Guillaume Massonnet et al.
· INFORMS journal on computing · 0 citations