Modeling and solving staff scheduling with partial weighted maxSAT

DOI10.1007/s10479-017-2693-yzbMath1434.90053DBLPjournals/anor/DemirovicMW19OpenAlexW2767925358WikidataQ59607527 ScholiaQ59607527MaRDI QIDQ1730743

Emir Demirović, Felix Winter, Nysret Musliu

Publication date: 6 March 2019

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-017-2693-y

zbMATH Keywords

cardinality constraintsemployee schedulingSAT encodingsmaxSAT

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theory of organizations, manpower planning in operations research (90B70)

Related Items (1)

Learning MAX-SAT from contextual examples for combinatorial optimisation

Uses Software

• Sat4j
• Open-WBO
• Riss

Cites Work

• Unnamed Item
• The first international nurse rostering competition 2010
• Staff scheduling and rostering: a review of applications, methods and models.
• maxSAT-based large neighborhood search for high school timetabling
• On the complexity of manpower shift scheduling
• Personnel scheduling: a literature review
• A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
• New approaches to nurse rostering benchmark instances
• Open-WBO: A Modular MaxSAT Solver,
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Cardinality Networks and Their Applications
• MaxSAT-Based Scheduling of B2B Meetings

This page was built for publication: Modeling and solving staff scheduling with partial weighted maxSAT