A note on the assignment problem with seniority and job priority constraints.

DOI10.1016/S0377-2217(03)00090-0zbMath1099.90561MaRDI QIDQ1420440

A. Volgenant

Publication date: 2 February 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Manpower planningHealth servicesLinear assignmentPriority rules

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Case-oriented studies in operations research (90B90) Theory of organizations, manpower planning in operations research (90B70)

Related Items

Assignment problems: a golden anniversary survey

Cites Work

• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
• Solving some lexicographic multi-objective combinatorial problems
• The Assignment Problem with Seniority and Job Priority Constraints
• A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
• Unnamed Item