Employee scheduling is a well known problem that appears in a wide range of different areas including health care, air lines, transportation services, and basically any organization that has to deal with workforces. In this paper we model a collection of challenging staff scheduling instances as a weighted partial Boolean maximum satisfiability (maxSAT) problem. Using our formulation we conduct a comparison of four different cardinality constraint encodings and analyze their applicability on this problem. Additionally, we measure the performance of two leading solvers from the maxSAT evaluation 2015 in a series of benchmark experiments and compare their results to state of the art solutions. In the process we also generate a number of challenging maxSAT instances that are publicly available and can be used as benchmarks for the development and verification of modern SAT solvers.

中文翻译：

---

部分加权maxSAT的人员排班建模与求解

员工排班是一个众所周知的问题，它出现在广泛的不同领域，包括医疗保健、航空公司、运输服务，以及基本上任何必须处理劳动力的组织。在本文中，我们将一组具有挑战性的员工调度实例建模为加权部分布尔最大可满足性 (maxSAT) 问题。使用我们的公式，我们对四种不同的基数约束编码进行了比较，并分析了它们在这个问题上的适用性。此外，我们在一系列基准实验中测量了 2015 年 maxSAT 评估中的两个领先求解器的性能，并将它们的结果与最先进的解决方案进行了比较。