Pages that link to "Item:Q1046124"
From MaRDI portal
The following pages link to A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems (Q1046124):
Displayed 15 items.
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- A constraint-based approach for the shift design personnel task scheduling problem with equity (Q336540) (← links)
- A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department (Q337117) (← links)
- A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem (Q338852) (← links)
- A constraint programming based column generation approach to nurse rostering problems (Q339698) (← links)
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling (Q342395) (← links)
- A systematic two phase approach for the nurse rostering problem (Q439701) (← links)
- A variable neighborhood search based matheuristic for nurse rostering problems (Q475191) (← links)
- A constructive heuristic for staff scheduling in the Glass industry (Q490177) (← links)
- The nurse rostering problem: a critical appraisal of the problem structure (Q1039781) (← links)
- A Pareto-based search methodology for multi-objective nurse scheduling (Q1761798) (← links)
- Shift rostering using decomposition: assign weekend shifts first (Q2018938) (← links)
- New approaches to nurse rostering benchmark instances (Q2514811) (← links)
- Minimizing shifts for personnel task scheduling problems: a three-phase algorithm (Q2514834) (← links)
- Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling (Q2630226) (← links)
