A grasp-knapsack hybrid for a nurse-scheduling problem
type: Item
instance of: scholarly article
title: A grasp-knapsack hybrid for a nurse-scheduling problem
zbMATH Open document ID: 1180.90119
author: Melissa D. Goodman
author: K. Dowsland
author: J. Thompson
published in: Journal of Heuristics
publication date: 2009-08-31T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5600114
zbMATH Keywords: nurse-scheduling
zbMATH Keywords: rostering
zbMATH Keywords: GRASP
zbMATH Keywords: hybrid
zbMATH Keywords: knapsack
describes a project that uses: Hyperheuristics
MaRDI profile type: Publication
full work available at URL: s10732-007-9066-7
OpenAlex ID: W2123388811
cites work: Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
cites work: An indirect genetic algorithm for a nurse-scheduling problem
cites work: An estimation of distribution algorithm for nurse scheduling
cites work: A greedy-based neighborhood search approach to a nurse rostering problem.
cites work: A grasp for job shop scheduling
cites work: Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations
cites work: A memetic approach to the nurse rostering problem
cites work: The state of the art of nurse rostering
cites work: Nurse rostering problems -- a bibliographic survey.
cites work: Nurse scheduling with tabu search and strategic oscillation
cites work: Solving a nurse scheduling problem with knapsacks, networks and tabu search
cites work: Distribution requirements and compactness constraints in school timetabling
cites work: Staff scheduling and rostering: a review of applications, methods and models.
cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
cites work: Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
cites work: Algorithms for single machine total tardiness scheduling with sequence dependent setups
cites work: An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
cites work: An implicit tour scheduling model with applications in healthcare
cites work: A generalized linear programming model for nurse scheduling
cites work: A GRASP for coloring sparse graphs
cites work: A simulated annealing and hill-climbing algorithm for the traveling tournament problem
cites work: Nurse rostering as constraint satisfaction with fuzzy constraints and inferred control strategies
cites work: Q3157878
cites work: A genetic algorithm approach to a nurse rerostering problem
cites work: Solving the multi-objective nurse scheduling problem with a weighted cost function
cites work: Variants of simulated annealing for the examination timetabling problem
cites work: Crane scheduling with non-crossing constraint
DOI: 10.1007/S10732-007-9066-7
description: scientific article; zbMATH DE number 5600114