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.
Keywords
- multiobjective mixed 0-1 linear program
- efficient solution
- mixed 0-1 linear program
- nurse rostering problems
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beaumont, N.: Scheduling staff using mixed integer programming. European Journal of Operation Research 98, 473–484 (1997)
Berrada, I., Ferland, J.A., Michelon, P.: A Multi-objective Approach to Nurse Scheduling with both Hard and Soft Constraints. Socio-Econ. Plann. Sci. 30(3), 183–193 (1996)
Burke, E.K., De Causmaecker, P., Vanden Berghe, G.: A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem. In: McKay, B., Yao, X., Newton, C.S., Kim, J.-H., Furuhashi, T. (eds.) SEAL 1998. LNCS (LNAI), vol. 1585, pp. 187–194. Springer, Heidelberg (1999)
Burke, E.K., De Causmaecker, P., Vanden Berghe, G., Van Landeghem, H.: The state of the art of nurse rostering. Journal of Scheduling 7, 441–499 (2004)
Burke, E.K., Li, J., Qu, R.: A hybrid model of integer programmming and variable neighbourhood search for highly-constrained nurse rostering problems. European Journal of Operation Research 203, 484–493 (2010)
Cheang, B., Li, H., Lim, A., Rodrigues, B.: Nurse rostering problems - A bibliographic survey. European Journal of Operation Research 151, 447–460 (2003)
Ehrgott, M., Gandibleux, X.: Approximative Solution Methods for Multiobjective Combinatorial Optimization. Sociedad de Estadística e Investigación Operativia 12(1), 1–89 (2004)
Ehrgott, M.: Multicriteria Optimization. Springer, Heidelberg (2005)
Ernst, A.T., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: A review of applications, methods and model 153, 3–27 (2004)
Glass, C.A., Knight, R.A.: The nurse rostering problem: A critical apparaisal of the problem structure. European Journal of Operation Research 202, 379–389 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pham, V.N., Le Thi, H.A., Pham Dinh, T. (2012). Solving Nurse Rostering Problems by a Multiobjective Programming Approach. In: Nguyen, NT., Hoang, K., Jȩdrzejowicz, P. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2012. Lecture Notes in Computer Science(), vol 7653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34630-9_56
Download citation
DOI: https://doi.org/10.1007/978-3-642-34630-9_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34629-3
Online ISBN: 978-3-642-34630-9
eBook Packages: Computer ScienceComputer Science (R0)