Pages that link to "Item:Q596433"
From MaRDI portal
The following pages link to Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models (Q596433):
Displayed 17 items.
- A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering (Q284416) (← links)
- A novel approach for nurse rerostering based on a parallel algorithm (Q322731) (← links)
- A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department (Q337117) (← links)
- A constructive heuristic for staff scheduling in the Glass industry (Q490177) (← links)
- An evolutionary approach for the nurse rerostering problem (Q632687) (← links)
- Solving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic (Q945046) (← links)
- Finding good nurse duty schedules: a case study (Q954255) (← links)
- The nurse rerostering problem: strategies for reconstructing disrupted schedules (Q1725622) (← links)
- ``You have to get wet to learn how to swim'' applied to bridging the gap between research into personnel scheduling and its implementation in practice (Q1730753) (← links)
- A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem (Q1749483) (← links)
- A comparison of two approaches to nurse rostering problems (Q1761915) (← links)
- Real-time bi-objective personnel re-scheduling in the retail industry (Q2030505) (← links)
- A learning large neighborhood search for the staff rerostering problem (Q2170207) (← links)
- Fair shift change penalization scheme for nurse rescheduling problems (Q2178145) (← links)
- A genetic algorithm approach to a nurse rerostering problem (Q2433376) (← links)
- Real-time personnel re-scheduling after a minor disruption in the retail industry (Q2664293) (← links)
- Dynamic routing-scheduling problem for home health care considering caregiver-patient compatibility (Q2676402) (← links)