ON A PERSONNEL ASSIGNMENT PROBLEM

DOI10.1142/S0129054190000060zbMATH Open0746.90041OpenAlexW2017980736MaRDI QIDQ3978357

Wandi Wei

Publication date: 25 June 1992

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054190000060

zbMATH Keywords

decompositioncomplete latticesrecursive procedureassignmentpartial orderslowest common ancestorsmaximal grouping

Mathematics Subject Classification ID

Integer programming (90C10) Theory of organizations, manpower planning in operations research (90B70)

Related Items (1)

Staff assignment with lexicographically ordered acceptance levels

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On solving a variation of the assignment problem 👍 👎
• The assignment problem revisited 👍 👎
• The assignment problem 👍 👎
• Near-optimal solution to an employee assignment problem with seniority 👍 👎
• The personnel task scheduling problem 👍 👎
• A personnel assignment problem 👍 👎
• A class of manpower scheduling problems 👍 👎

This page was built for publication: ON A PERSONNEL ASSIGNMENT PROBLEM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978357)