ON A PERSONNEL ASSIGNMENT PROBLEM
The paper addresses the following problem: Given a rooted tree \(T\) with \(n\) nodes and an integer \(k\); what is the maximum number \(m\) of nodes of \(T\), such that those \(m\) nodes can be grouped into exactly \(m/(k+1)\) disjoint subsets, each of them consists of \(k\) nodes of \(T\) and additionally a `leader' \(t\), which is a common ancestor of those \(k\) nodes in \(T\). The author proves a theorem on \(m\), which gives a recursive procedure of finding such a maximal grouping. Additionally he shows a recurrence for the number of different maximal groupings. The paper is rather technical. Some connections to complete lattices as well as algorithms for determining lowest common ancestors are on hand, but are not worked out, even not mentioned at all.
- scientific article; zbMATH DE number 6600
- A personnel assignment problem
- The personnel task scheduling problem
- On solving a variation of the assignment problem
- A class of manpower scheduling problems
- Near-optimal solution to an employee assignment problem with seniority
- The assignment problem
- scientific article; zbMATH DE number 30946
- The assignment problem revisited
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)
