arXiv (All)
open access
From Metaheuristics to Exact Methods: A CP-SAT Approach for Multi-Objective Healthcare Workforce Scheduling
Healthcare workforce scheduling is an NP-hard optimization problem requiring simultaneous satisfaction of labor regulations, coverage requirements, employee preferences and cost objectives. Existing approaches (genetic algorithms, integer programming, constraint programming) model 6-12 constraints a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Ethical Considerations in the Use of Artificial Intelligence and Machine Learning in Health Care: A Comprehensive Review#133981
- Generative artificial intelligence in healthcare: ethical considerations and assessment checklist#232882
- Metaheuristic nurse scheduling with hospital clustering using flower pollination algorithm#343237
- Cooperative Integer Programming Games: Core Stability and Optimal Coalition Structures#998669
- Designing Nurse-Physician Collaboration to Improve Psychological Safety, Satisfaction and Commitment of Critical Care Nurses-A Multi-Informant Survey Study.#334892
Record · ID 820690
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive