Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models
type: Item
instance of: scholarly article
title: Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models
zbMATH Open document ID: 1056.90072
author: Margarida Moz
author: Margarida Vaz Pato
published in: Annals of Operations Research
publication date: 2004-08-10T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 2085773
zbMATH Keywords: nurse scheduling
zbMATH Keywords: rerostering
zbMATH Keywords: integer multicommodity flow problems
zbMATH Keywords: binary linear programming
MaRDI profile type: Publication
full work available at URL: b:anor.0000019104.39239.ed
OpenAlex ID: W2062690651
DOI: 10.1023/B:ANOR.0000019104.39239.ED
Recommended article: An integer multicommodity flow model applied to the rerostering of nurse schedules
Recommended article: A Novel Approach for the Nurse Scheduling Problem
Recommended article: A subproblem-centric model and approach to the nurse scheduling problem
Recommended article: The nurse rerostering problem: strategies for reconstructing disrupted schedules
Recommended article: Integer programming model extensions for a multi-stage nurse rostering problem
Recommended article: ILP Models for a Nurse Scheduling Problem
Recommended article: A flexible mixed integer programming-based system for real-world nurse rostering
description: scientific article; zbMATH DE number 2085773