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 31 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 variable neighborhood search algorithm for the surgery tactical planning problem (Q1652340) (← links)
- Simulated annealing approach to nurse rostering benchmark and real-world instances (Q1730622) (← links)
- Integer programming model extensions for a multi-stage nurse rostering problem (Q1730747) (← links)
- A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem (Q1736555) (← links)
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems (Q1751653) (← links)
- A Pareto-based search methodology for multi-objective nurse scheduling (Q1761798) (← 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 matheuristic for the 0--1 generalized quadratic multiple knapsack problem (Q2070116) (← links)
- A flexible mixed integer programming-based system for real-world nurse rostering (Q2124911) (← links)
- E-platooning: optimizing platoon formation for long-haul transportation with electric commercial vehicles (Q2171599) (← links)
- A survey on the applications of variable neighborhood search algorithm in healthcare management (Q2240705) (← links)
- An integer programming approach for the physician rostering problem (Q2241148) (← links)
- A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization (Q2312327) (← 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)
- An MIP model to schedule the call center workforce and organize the breaks (Q4989258) (← links)
- Physician Staffing for Emergency Departments with Time-Varying Demand (Q5136082) (← links)
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (Q6146649) (← links)
- On a timetabling problem in the health care system (Q6186584) (← links)