Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models

DOI10.1023/B:ANOR.0000019104.39239.edzbMath1056.90072OpenAlexW2062690651MaRDI QIDQ596433

Margarida Vaz Pato, Margarida Moz

Publication date: 10 August 2004

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:anor.0000019104.39239.ed

zbMATH Keywords

binary linear programmingnurse schedulinginteger multicommodity flow problemsrerostering

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

This page was built for publication: Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models