Solving the Problem of Rerostering Nurse Schedules with Hard Constraints: New Multicommodity Flow Models

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.128, Iss.1-4, 2004-04, pp. : 179-197

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An Integer Multicommodity Flow Model Applied to the Rerostering of Nurse Schedules

By Moz M.

Annals of Operations Research, Vol. 119, Iss. 1-4, 2003-03 ,pp. : 285-301

Springer Publishing Company

Access to resources Recommend Favorite

Iterative mass balance method for the multi-commodity flow maximisation problem

By Ursani Ziauddin

Production Planning and Control, Vol. 25, Iss. 7, 2014-05 ,pp. : 592-602

Taylor & Francis Ltd

Access to resources Recommend Favorite

A New Approach to Solving Equivalence Problem

By Podlovchenko R. I. Khachatryan V. E.

Programming and Computer Software, Vol. 30, Iss. 3, 2004-05 ,pp. : 121-133

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A Global Optimization RLT-based Approach for Solving the Hard Clustering Problem

By Sherali Hanif Desai Jitamitra

Journal of Global Optimization, Vol. 32, Iss. 2, 2005-06 ,pp. : 281-306

Springer Publishing Company

Access to resources Recommend Favorite

A General Scheme for Solving an NP-hard Problem in the Strong Sense of the Scheduling Theory

By Shul'gina O. N.

Automation and Remote Control, Vol. 65, Iss. 3, 2004-03 ,pp. : 456-463

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite