Pages that link to "Item:Q475191"

The following pages link to A variable neighborhood search based matheuristic for nurse rostering problems (Q475191):

Displaying 20 items.

• Genetic based discrete particle swarm optimization for elderly day care center timetabling (Q342133) (← links)
• Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time (Q723919) (← links)
• A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
• Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283) (← links)
• Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing (Q1725608) (← links)
• The second international nurse rostering competition (Q1730710) (← links)
• Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure (Q1730745) (← links)
• Staff assignment with lexicographically ordered acceptance levels (Q1743648) (← links)
• A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems (Q1751653) (← links)
• A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem (Q1983752) (← links)
• Combining workload balance and patient priority maximisation in operating room planning through hierarchical multi-objective optimisation (Q2076840) (← links)
• A simple and effective algorithm for the maximum happy vertices problem (Q2121620) (← links)
• Inbound and outbound flow integration for cross-docking operations (Q2240064) (← 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 matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders (Q2307325) (← links)
• First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem (Q2664285) (← links)
• A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem (Q2668655) (← links)
• MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem (Q2676278) (← links)
• An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping (Q6047843) (← links)