Pages that link to "Item:Q1579122"

The following pages link to Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem (Q1579122):

Displaying 33 items.

• Near-optimal MIP solutions for preference based self-scheduling (Q284428) (← links)
• 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)
• Bridging the gap between self schedules and feasible schedules in staff scheduling (Q475167) (← 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 decision support system for cyclic master surgery scheduling with multiple objectives (Q842555) (← links)
• Cyclic preference scheduling of nurses using a Lagrangian-based heuristic (Q880573) (← links)
• A variable neighborhood search algorithm for the multimode set covering problem (Q887195) (← links)
• Comparison and hybridization of crossover operators for the nurse scheduling problem (Q940898) (← links)
• A hybrid scatter search heuristic for personalized crew rostering in the airline industry (Q976415) (← 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)
• A greedy-based neighborhood search approach to a nurse rostering problem. (Q1417481) (← links)
• An indirect genetic algorithm for a nurse-scheduling problem (Q1433170) (← links)
• Accelerating the branch-and-price algorithm using machine learning (Q1653391) (← links)
• Simulated annealing approach to nurse rostering benchmark and real-world instances (Q1730622) (← links)
• What makes a VRP solution good? The generation of problem-specific knowledge for heuristics (Q1734855) (← links)
• Staff assignment with lexicographically ordered acceptance levels (Q1743648) (← links)
• A Pareto-based search methodology for multi-objective nurse scheduling (Q1761798) (← links)
• Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← 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)
• Scheduling trainees at a hospital department using a branch-and-price approach (Q2432850) (← links)
• An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria (Q2433375) (← links)
• Analysis of three mathematical models of the staff rostering problem (Q2434266) (← 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)
• Team-building with answer set programming in the Gioia-Tauro seaport (Q2909524) (← links)
• (Q5069581) (← links)