Pages that link to "Item:Q2470097"
From MaRDI portal
The following pages link to A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem (Q2470097):
Displayed 32 items.
- A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department (Q337117) (← links)
- Scheduled penalty variable neighborhood search (Q337204) (← links)
- A particle swarm optimization approach with refinement procedure for nurse rostering problem (Q337337) (← links)
- A two-phase adaptive variable neighborhood approach for nurse rostering (Q337577) (← links)
- A constraint programming based column generation approach to nurse rostering problems (Q339698) (← links)
- A systematic two phase approach for the nurse rostering problem (Q439701) (← links)
- A heuristic algorithm based on multi-assignment procedures for nurse scheduling (Q475190) (← links)
- A hybrid metaheuristic case-based reasoning system for nurse rostering (Q842550) (← links)
- A decision support system for cyclic master surgery scheduling with multiple objectives (Q842555) (← links)
- Finding good nurse duty schedules: a case study (Q954255) (← links)
- On the characterization and generation of nurse scheduling problem instances (Q1027526) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- The nurse rostering problem: a critical appraisal of the problem structure (Q1039781) (← links)
- A shift scheduling model for employees with different seniority levels and an application in healthcare (Q1042079) (← links)
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems (Q1046124) (← links)
- Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis (Q1048653) (← links)
- A hybrid integer and constraint programming approach to solve nurse rostering problems (Q1652269) (← links)
- The nurse rerostering problem: strategies for reconstructing disrupted schedules (Q1725622) (← links)
- Simulated annealing approach to nurse rostering benchmark and real-world instances (Q1730622) (← links)
- Modeling and solving staff scheduling with partial weighted maxSAT (Q1730743) (← links)
- A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem (Q1736555) (← links)
- A Pareto-based search methodology for multi-objective nurse scheduling (Q1761798) (← links)
- Local search neighbourhoods for dealing with a novel nurse rostering model (Q1761887) (← links)
- A shift sequence based approach for nurse scheduling and a new benchmark dataset (Q1959177) (← links)
- A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem (Q1983752) (← links)
- Shift rostering using decomposition: assign weekend shifts first (Q2018938) (← links)
- A survey on the applications of variable neighborhood search algorithm in healthcare management (Q2240705) (← links)
- New approaches to nurse rostering benchmark instances (Q2514811) (← links)
- Minimizing shifts for personnel task scheduling problems: a three-phase algorithm (Q2514834) (← links)
- First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem (Q2664285) (← links)
- HARMONY SEARCH WITH NOVEL SELECTION METHODS IN MEMORY CONSIDERATION FOR NURSE ROSTERING PROBLEM (Q2875630) (← links)
- Physician Staffing for Emergency Departments with Time-Varying Demand (Q5136082) (← links)