A greedy-based neighborhood search approach to a nurse rostering problem.
type: Item
instance of: scholarly article
title: A greedy-based neighborhood search approach to a nurse rostering problem.
zbMATH Open document ID: 1053.90090
DOI: 10.1016/S0377-2217(03)00096-1
author: F. Bellanti
author: Giuliana Carello
author: F. Della Croce
author: Roberto Tadei
published in: European Journal of Operational Research
publication date: 2004-01-05T00:00:00Z
Mathematics Subject Classification ID: 90B99
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2021171
zbMATH Keywords: Nurse rostering
zbMATH Keywords: Tabu search
zbMATH Keywords: Iterated local search
MaRDI profile type: Publication
cites work: Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
cites work: An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
cites work: An introduction to timetabling
cites work: The combinatorics of timetabling
cites work: Nurse scheduling with tabu search and strategic oscillation
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Nurse Scheduling Using Mathematical Programming
cites work: Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach
description: scientific article; zbMATH DE number 2021171