Bound-consistent spread constraint: Application to load balancing in nurse-to-patient assignments

Given a vector of finite domain variables, the spread constraint aims at minimizing the sum of squares of these variables while constraining the sum of these to be equal to a given value. We improve the existing filtering for spread achieving a bound-consistent filtering without increasing the compl...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Pierre Schaus, Jean-Charles Régin
Formato:	article
Lenguaje:	EN
Publicado:	Elsevier 2014
Materias:	90-XX Operations research mathematical programming Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/a216cc33597c4e4d8728a16350fe346c
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:a216cc33597c4e4d8728a16350fe346c
record_format	dspace
spelling	oai:doaj.org-article:a216cc33597c4e4d8728a16350fe346c2021-12-02T05:00:40ZBound-consistent spread constraint: Application to load balancing in nurse-to-patient assignments2192-440610.1007/s13675-013-0018-8https://doaj.org/article/a216cc33597c4e4d8728a16350fe346c2014-08-01T00:00:00Zhttp://www.sciencedirect.com/science/article/pii/S2192440621000307https://doaj.org/toc/2192-4406Given a vector of finite domain variables, the spread constraint aims at minimizing the sum of squares of these variables while constraining the sum of these to be equal to a given value. We improve the existing filtering for spread achieving a bound-consistent filtering without increasing the complexity. Previous versions of the algorithm considered a relaxed version of the bound-consistency assuming interval domains defined on rational numbers rather than integers. We apply our new algorithm to a real-life problem: the daily assignment of newborn infant patients to nurses in a hospital. The objective is to balance the workload of the nurses, while satisfying a variety of side constraints. Prior work proposed a MIP model for this problem, which unfortunately did not scale to large instances and only approximated the objective function, since minimizing the variance cannot be expressed in a linear model. This paper presents a two-step approach, first assigning nurses to region of the hospital then assigning the patients to these nurses. We show that our approach allows to tackle large instances with hundreds of patients and nurses in a few seconds using the OscaR optimization system.Pierre SchausJean-Charles RéginElsevierarticle90-XX Operations researchmathematical programmingApplied mathematics. Quantitative methodsT57-57.97Electronic computers. Computer scienceQA75.5-76.95ENEURO Journal on Computational Optimization, Vol 2, Iss 3, Pp 123-146 (2014)
institution	DOAJ
collection	DOAJ
language	EN
topic	90-XX Operations research mathematical programming Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
spellingShingle	90-XX Operations research mathematical programming Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95 Pierre Schaus Jean-Charles Régin Bound-consistent spread constraint: Application to load balancing in nurse-to-patient assignments
description	Given a vector of finite domain variables, the spread constraint aims at minimizing the sum of squares of these variables while constraining the sum of these to be equal to a given value. We improve the existing filtering for spread achieving a bound-consistent filtering without increasing the complexity. Previous versions of the algorithm considered a relaxed version of the bound-consistency assuming interval domains defined on rational numbers rather than integers. We apply our new algorithm to a real-life problem: the daily assignment of newborn infant patients to nurses in a hospital. The objective is to balance the workload of the nurses, while satisfying a variety of side constraints. Prior work proposed a MIP model for this problem, which unfortunately did not scale to large instances and only approximated the objective function, since minimizing the variance cannot be expressed in a linear model. This paper presents a two-step approach, first assigning nurses to region of the hospital then assigning the patients to these nurses. We show that our approach allows to tackle large instances with hundreds of patients and nurses in a few seconds using the OscaR optimization system.
format	article
author	Pierre Schaus Jean-Charles Régin
author_facet	Pierre Schaus Jean-Charles Régin
author_sort	Pierre Schaus
title	Bound-consistent spread constraint: Application to load balancing in nurse-to-patient assignments
title_short	Bound-consistent spread constraint: Application to load balancing in nurse-to-patient assignments
title_full	Bound-consistent spread constraint: Application to load balancing in nurse-to-patient assignments
title_fullStr	Bound-consistent spread constraint: Application to load balancing in nurse-to-patient assignments
title_full_unstemmed	Bound-consistent spread constraint: Application to load balancing in nurse-to-patient assignments
title_sort	bound-consistent spread constraint: application to load balancing in nurse-to-patient assignments
publisher	Elsevier
publishDate	2014
url	https://doaj.org/article/a216cc33597c4e4d8728a16350fe346c
work_keys_str_mv	AT pierreschaus boundconsistentspreadconstraintapplicationtoloadbalancinginnursetopatientassignments AT jeancharlesregin boundconsistentspreadconstraintapplicationtoloadbalancinginnursetopatientassignments
_version_	1718400845714817024

Bound-consistent spread constraint: Application to load balancing in nurse-to-patient assignments

Ejemplares similares