Local search neighbourhoods for dealing with a novel nurse rostering model
type: Item
instance of: scholarly article
title: Local search neighbourhoods for dealing with a novel nurse rostering model
zbMATH Open document ID: 1251.90116
author: Burak Bilgin
author: Benoît Rossie
author: Patrick De Causmaecker
published in: Annals of Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6107400
zbMATH Keywords: nurse rostering
zbMATH Keywords: hospital personnel planning
zbMATH Keywords: variable neighbourhood search
describes a project that uses: Hyperheuristics
describes a project that uses: HIBISCUS
MaRDI profile type: Publication
full work available at URL: s10479-010-0804-0
OpenAlex ID: W1978831829
cites work: An estimation of distribution algorithm for nurse scheduling
cites work: Cyclic preference scheduling of nurses using a Lagrangian-based heuristic
cites work: On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem
cites work: A greedy-based neighborhood search approach to a nurse rostering problem.
cites work: A shift sequence based approach for nurse scheduling and a new benchmark dataset
cites work: A memetic approach to the nurse rostering problem
cites work: The state of the art of nurse rostering
cites work: A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
cites work: Polynomially solvable personnel rostering problems
cites work: The nurse rostering problem: a critical appraisal of the problem structure
cites work: Variable Neighborhood Search
cites work: Comparison and hybridization of crossover operators for the nurse scheduling problem
cites work: A comparison of two approaches to nurse rostering problems
cites work: A general heuristic for vehicle routing problems
DOI: 10.1007/S10479-010-0804-0
description: scientific article; zbMATH DE number 6107400