Solving a nurse scheduling problem with knapsacks,networks and tabu search |
| |
Authors: | K A Dowsland J M Thompson |
| |
Institution: | 1.Swansea University,Swansea;2.Cardiff University,Cardiff |
| |
Abstract: | This paper illustrates how a modern heuristic and two classical integer programming models have been combined to provide a solution to a nurse rostering problem at a major UK hospital. Neither a heuristic nor an exact approach based on a standard IP package was able to meet all the practical requirements. This was overcome by using a variant of tabu search as the core method, but applying knapsack and network flow models in pre- and post-processing phases. The result is a successful software tool that frees senior nursing staff from a time consuming administrative task. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |