Pages that link to "Item:Q5952118"

The following pages link to A memetic approach to the nurse rostering problem (Q5952118):

Displaying 36 items.

• A constraint-based approach for the shift design personnel task scheduling problem with equity (Q336540) (← links)
• A particle swarm optimization approach with refinement procedure for nurse rostering problem (Q337337) (← links)
• A systematic two phase approach for the nurse rostering problem (Q439701) (← links)
• Bridging the gap between self schedules and feasible schedules in staff scheduling (Q475167) (← links)
• A constructive heuristic for staff scheduling in the Glass industry (Q490177) (← links)
• Nurse rostering at a Danish ward (Q490204) (← links)
• An evolutionary approach for the nurse rerostering problem (Q632687) (← links)
• A grasp-knapsack hybrid for a nurse-scheduling problem (Q835758) (← links)
• A hybrid metaheuristic case-based reasoning system for nurse rostering (Q842550) (← links)
• A (0-1) goal programming model for scheduling the tour of a marketing executive (Q858472) (← links)
• Cyclic preference scheduling of nurses using a Lagrangian-based heuristic (Q880573) (← links)
• Comparison and hybridization of crossover operators for the nurse scheduling problem (Q940898) (← links)
• Solving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic (Q945046) (← links)
• A hybrid scatter search heuristic for personalized crew rostering in the airline industry (Q976415) (← links)
• Stochastic programming for nurse assignment (Q1001188) (← links)
• On the characterization and generation of nurse scheduling problem instances (Q1027526) (← links)
• A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems (Q1046124) (← links)
• Nurse rostering problems -- a bibliographic survey. (Q1410304) (← links)
• Staff scheduling and rostering: a review of applications, methods and models. (Q1417478) (← links)
• Iterative restart technique for solving timetabling problems. (Q1417483) (← links)
• A hybrid integer and constraint programming approach to solve nurse rostering problems (Q1652269) (← links)
• Simulated annealing approach to nurse rostering benchmark and real-world instances (Q1730622) (← links)
• A Pareto-based search methodology for multi-objective nurse scheduling (Q1761798) (← links)
• Local search neighbourhoods for dealing with a novel nurse rostering model (Q1761887) (← links)
• Towards a reference model for timetabling and rostering (Q1761899) (← links)
• A comparison of two approaches to nurse rostering problems (Q1761915) (← links)
• A shift sequence based approach for nurse scheduling and a new benchmark dataset (Q1959177) (← links)
• Shift rostering using decomposition: assign weekend shifts first (Q2018938) (← links)
• A flexible mixed integer programming-based system for real-world nurse rostering (Q2124911) (← links)
• An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria (Q2433375) (← links)
• Distributed personnel scheduling -- negotiation among scheduling agents (Q2468742) (← links)
• Towards a practical engineering tool for rostering (Q2468743) (← 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)
• A branch-and-price approach for integrating nurse and surgery scheduling (Q2482743) (← links)
• First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem (Q2664285) (← links)