nurse-scheduling
importedsoftware/nurse-scheduling
Find an optimal assignment for a group of nurses, under constraints of scheduling and personnel.
Machine-generated from the listed sources and not yet reviewed by a human.
- Category
- Software & Systems
- Subcategory
- unknown
- License
- Apache-2.0(osi)
- Status
- active
- Maturity
- deployed
- Organization
- dwave-examples
- Country
- unknown
- Homepage
- unknown
- Documentation
- unknown
- Tags
- bqm · constraint-satisfaction-problem · healthcare · hybrid-solution · intermediate · optimization
- Regulatory
- unknown
Top contributors by commit count, from the project’s public repository. Avatars are served by their origin, not stored here. To be removed from this list, open an issue.
Computed from shared tags, weighted so a rare tag counts for more than a common one. These are suggestions, not curated relationships.
- winter-flow-ai-hospital-surge-digital-twinhealthcare · optimization
AI hospital surge digital twin for winter respiratory virus surge planning using Streamlit, SimPy, scikit-learn, and Plotly
- adaptive_interference_inferenceoptimization
A mathematical optimization problem, inspired by an apparent paradox in the physics of optical measurement. Read the micro-publication here:…
- AI-TI-RADSoptimization
AI TI-RADS system optimized using genetic algorithm
- deepmodeloptimoptimization
Stochastic Testing and Input Manipulation for Unbiased Learning Systems
- healthGraphOptoptimization
Allocation optimization of patients during covid pandemic using real data from Brazil 2020-2022 period.
- macpan2optimization
Tools for building and calibrating compartmental models of infectious disease.
- api.github.com/repos/dwave-examples/nurse-schedulingretrieved 2026-08-05 · via github-api
Machine-imported from GitHub search. Last push 2026-02-27, 57 stars, license reported as Apache-2.0. Category and schematic were assigned by keyword heuristics and are unreviewed.
Not yet verified by a human. Correct this record →
/v1/entries/63.json→ .entries["nurse-scheduling"]
Entries are sharded 64 ways by a stable hash of the id, so a consumer can find any record without an index.