In this paper, periodic event scheduling problems (PESP) are encoded as satisfiability problems (SAT) and solved by a state-of-the-art SAT solver. Two encodings, based on direct and order encoded domains, are presented. An experimental evaluation suggests that the SAT-based approach using order encoding outperforms constraint-based PESP solvers, which until now were considered to be the best solvers for PESP. This opens the possibility to model significantly larger real-world problems.
['Peter Großmann', 'Steffen Hölldobler', 'Norbert Manthey', 'Karl Nachtigall', 'Jens Opitz', 'Peter Steinke']
Solving periodic event scheduling problems with SAT