Pages that link to "Item:Q3156615"

The following pages link to Solving a nurse scheduling problem with knapsacks, networks and tabu search (Q3156615):

Displaying 14 items.

• A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department (Q337117) (← links)
• A particle swarm optimization approach with refinement procedure for nurse rostering problem (Q337337) (← links)
• The impact of reserve duties on the robustness of a personnel shift roster: an empirical investigation (Q337610) (← links)
• A systematic two phase approach for the nurse rostering problem (Q439701) (← links)
• Nurse rostering at a Danish ward (Q490204) (← links)
• An optimal decision-making approach for the management of radiotherapy patients (Q626638) (← links)
• A grasp-knapsack hybrid for a nurse-scheduling problem (Q835758) (← links)
• Finding good nurse duty schedules: a case study (Q954255) (← links)
• Nurse scheduling using fuzzy modeling approach (Q969562) (← links)
• A shift scheduling model for employees with different seniority levels and an application in healthcare (Q1042079) (← links)
• The impact of overtime as a time-based proactive scheduling and reactive allocation strategy on the robustness of a personnel shift roster (Q1743647) (← links)
• A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems (Q1751653) (← links)
• Employee substitutability as a tool to improve the robustness in personnel scheduling (Q2014585) (← links)
• Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) (← links)