Sciweavers

10 search results - page 2 / 2
» Nurse Rostering with Genetic Algorithms
Sort
View
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 7 months ago
An Indirect Genetic Algorithm for a Nurse Scheduling Problem
This paper describes a Genetic Algorithms approach to a manpower-scheduling problem arising at a major UK hospital. Although Genetic Algorithms have been successfully used for sim...
Uwe Aickelin, Kathryn A. Dowsland
PRICAI
1998
Springer
13 years 12 months ago
Dynamic Constraint Weighting for Over-Constrained Problems
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
John Thornton, Abdul Sattar
PPSN
2004
Springer
14 years 1 months ago
The Application of Bayesian Optimization and Classifier Systems in Nurse Scheduling
Two ideas taken from Bayesian optimization and classifier systems are presented for personnel scheduling based on choosing a suitable scheduling rule from a set for each person’s...
Jingpeng Li, Uwe Aickelin
EMO
2006
Springer
170views Optimization» more  EMO 2006»
13 years 11 months ago
Robust Multi-Objective Optimization in High Dimensional Spaces
1 In most real world optimization problems several optimization goals have to be considered in parallel. For this reason, there has been a growing interest in Multi-Objective Optim...
André Sülflow, Nicole Drechsler, Rolf ...
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 7 months ago
Explicit Learning: an Effort towards Human Scheduling Algorithms
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
Jingpeng Li, Uwe Aickelin