Pages that link to "Item:Q1417481"

The following pages link to A greedy-based neighborhood search approach to a nurse rostering problem. (Q1417481):

Displayed 16 items.

• Complexity results for the basic residency scheduling problem (Q398919) ‎ (← links)
• A variable neighborhood search based matheuristic for nurse rostering problems (Q475191) ‎ (← 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)
• Generating, scheduling and rostering of shift crew-duties: applications at the Hong Kong international airport (Q857315) ‎ (← links)
• Finding good nurse duty schedules: a case study (Q954255) ‎ (← links)
• On the characterization and generation of nurse scheduling problem instances (Q1027526) ‎ (← links)
• Local search neighbourhoods for dealing with a novel nurse rostering model (Q1761887) ‎ (← links)
• A comparison of two approaches to nurse rostering problems (Q1761915) ‎ (← links)
• Workforce planning in a lotsizing mail processing problem (Q1781576) ‎ (← links)
• Solving the multi-objective nurse scheduling problem with a weighted cost function (Q2468745) ‎ (← links)
• An estimation of distribution algorithm for nurse scheduling (Q2468746) ‎ (← links)
• A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem (Q2470097) ‎ (← links)
• New approaches to nurse rostering benchmark instances (Q2514811) ‎ (← links)
• Minimizing shifts for personnel task scheduling problems: a three-phase algorithm (Q2514834) ‎ (← links)