Solving nurse rostering problems by a multiobjective programming approach

Authors:
Viet Nga Pham;Hoai An Le Thi;Tao Pham Dinh
Affiliations:
Laboratory of Mathematics, National Institute for Applied Sciences - Rouen, Saint Etienne du Rouvray, France;Laboratory of Theorical and Applied computer Science LITA EA 3097, University of Lorraine, Ile du Saulcy-Metz, France;Laboratory of Mathematics, National Institute for Applied Sciences - Rouen, Saint Etienne du Rouvray, France
Venue:
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I
Year:
2012

Citing 3
Cited 0

A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem

SEAL'98 Selected papers from the Second Asia-Pacific Conference on Simulated Evolution and Learning on Simulated Evolution and Learning
The State of the Art of Nurse Rostering

Journal of Scheduling
Multicriteria Optimization

Multicriteria Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a multiobjective programming approach for solving nurse rostering problems. We first formulate the nurse rostering problems as a multiobjective mixed 0-1 linear program and then prove that finding an efficient solution of the last program leads to solving one mixed 0-1 linear problem. Two benchmark problems are considered and computational experiments are presented.