Pages that link to "Item:Q1730622"
From MaRDI portal
The following pages link to Simulated annealing approach to nurse rostering benchmark and real-world instances (Q1730622):
Displaying 9 items.
- A subproblem-centric model and approach to the nurse scheduling problem (Q1403303) (← links)
- A comparison of two approaches to nurse rostering problems (Q1761915) (← links)
- A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem (Q1983752) (← links)
- Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds (Q2030469) (← links)
- A flexible mixed integer programming-based system for real-world nurse rostering (Q2124911) (← links)
- A simulated annealing approach to the solution of job rotation scheduling problems (Q2371395) (← links)
- A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem (Q2668655) (← links)
- A component-based heuristic search method with evolutionary eliminations for hospital personnel scheduling (Q2901079) (← links)
- A game-theory-based scheme to facilitate consensus latency minimization in sharding blockchain (Q6179990) (← links)