Nurse scheduling with tabu search and strategic oscillation
From MaRDI portal
Publication:1609902
DOI10.1016/S0377-2217(97)00281-6zbMATH Open0991.90055OpenAlexW1981097545MaRDI QIDQ1609902FDOQ1609902
Authors: K. Dowsland 
Publication date: 18 August 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00281-6
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Search theory (90B40)
Cites Work
- A note on two problems in connexion with graphs
- Variants of simulated annealing for the examination timetabling problem
- A simulated-annealing heuristic for shift scheduling using non-continuously available employees
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Simulated Annealing Approach to the Solution of Flexible Labour Scheduling Problems
- A simulated annealing approach to the cyclic staff-scheduling problem
Cited In (51)
- Harmony search with novel selection methods in memory consideration for nurse rostering problem
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- Simulated annealing approach to nurse rostering benchmark and real-world instances
- A heuristic algorithm for the hospital health examination scheduling problem
- A shift scheduling model for employees with different seniority levels and an application in healthcare
- Solving a nurse scheduling problem with knapsacks, networks and tabu search
- Near-optimal MIP solutions for preference based self-scheduling
- Repairing high school timetables with polymorphic ejection chains
- Staff assignment with lexicographically ordered acceptance levels
- A systematic two phase approach for the nurse rostering problem
- A (0-1) goal programming model for scheduling the tour of a marketing executive
- Bridging the gap between self schedules and feasible schedules in staff scheduling
- Modeling staff scheduling problems. A tutorial
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Optimizing production smoothing decisions via batch selection for mixed-model just-in-time manufacturing systems with arbitrary setup and processing times
- A survey of very large-scale neighborhood search techniques
- A hybrid meta-heuristic for the batching problem in just-in-time flow shops
- \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care
- An optimal decision-making approach for the management of radiotherapy patients
- Nurse rostering problems -- a bibliographic survey.
- Staff scheduling and rostering: a review of applications, methods and models.
- Accelerating the branch-and-price algorithm using machine learning
- Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
- Building better nurse scheduling algorithms
- First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem
- A grasp-knapsack hybrid for a nurse-scheduling problem
- A shift sequence based approach for nurse scheduling and a new benchmark dataset
- A hybrid metaheuristic case-based reasoning system for nurse rostering
- Personnel scheduling: models and complexity
- A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department
- A particle swarm optimization approach with refinement procedure for nurse rostering problem
- Solving a multi-objective multi-skilled manpower scheduling model by a fuzzy goal programming approach
- Nurse scheduling using genetic algorithm
- The nurse rerostering problem: strategies for reconstructing disrupted schedules
- Scheduling part-time personnel with availability restrictions and preferences to maximize employee satisfaction
- Branch-and-cut for complementarity-constrained optimization
- Preference scheduling for nurses using column generation
- An indirect genetic algorithm for a nurse-scheduling problem
- Cyclic preference scheduling of nurses using a Lagrangian-based heuristic
- Solving the multi-objective nurse scheduling problem with a weighted cost function
- A branch-and-price approach for integrating nurse and surgery scheduling
- Nurse scheduling using fuzzy modeling approach
- On the characterization and generation of nurse scheduling problem instances
- A greedy-based neighborhood search approach to a nurse rostering problem.
- Coordinated lab-clinics: a tactical assignment problem in healthcare
- A Pareto-based search methodology for multi-objective nurse scheduling
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
- Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering
- Constructing nurse schedules at large hospitals
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
Uses Software
This page was built for publication: Nurse scheduling with tabu search and strategic oscillation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1609902)
