You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: University of Stirling » Outputs » Detail

Output details

11 - Computer Science and Informatics

University of Stirling

Return to search Previous output Next output

Output 0 of 0 in the submission

Article title

A Hybrid Model of Integer Programming and Variable Neighbourhood Search for Highly-Constrained Nurse Rostering Problems

Type

D - Journal article

DOI

10.1016/j.ejor.2009.07.036

Title of journal

European Journal of Operational Research

Article number

Volume number

203

Issue number

First page of article

484

ISSN of journal

0377-2217

Year of publication

2010

URL

Number of additional authors

Additional information

<22> This paper presents a new hybrid decomposition approach that combines Integer Programming and Variable Neighbourhood Search to effectively solve the nurse rostering problem in a Dutch hospital. The approach could be applied to other resource-allocation problems defined by a large number of constraints. The research sheds light on the issue of integrating the two broad methodologies of exact algorithms and metaheuristics. It is attracting significant attention from practitioners and researchers in mathematical programming and heuristic design and is cited in a recent review on personnel scheduling (Van D Bergh et al. European Journal of Operational Research 226(3):367-385).

Interdisciplinary

Cross-referral requested

Research group

None

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract