Generalized assignment type goal programming problem: application to nurse scheduling
From MaRDI portal
Publication:1850969
DOI10.1023/A:1011392328632zbMath1173.90403OpenAlexW1573636743MaRDI QIDQ1850969
Jacques A. Ferland, Ilham Berrada, Imene Nabli, Viviane Gascon, Philippe Yves Paul Michelon, Belaïd Ahiod, Eric Gagné
Publication date: 15 December 2002
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1011392328632
Related Items (5)
Efficient and Local Efficient Solutions for Assignment Type Problems ⋮ Preference scheduling for nurses using column generation ⋮ A particle swarm optimization approach with refinement procedure for nurse rostering problem ⋮ Cyclic preference scheduling of nurses using a Lagrangian-based heuristic ⋮ An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
This page was built for publication: Generalized assignment type goal programming problem: application to nurse scheduling