A personnel assignment problem

DOI10.1016/0196-6774(84)90043-9MaRDI QIDQ3327716zbMATH OpenOpenAlexFDO

Authors

Publication date 1984

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(84)90043-9

zbMATH Keywords

algorithmslinear orderNP-completenesspartial orderpersonnel assignment problem

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 6600
• Balloting Labelling and Personnel Assignment
• A note on the assignment problem with seniority and job priority constraints.
• The assignment problem with seniority and job priority constraints
• scientific article; zbMATH DE number 841607

Cited in

(11)

• On the complexity of a family of generalized matching problems
• Staff assignment with lexicographically ordered acceptance levels
• A linear time algorithm for maximum matchings in convex, bipartite graphs
• Balloting Labelling and Personnel Assignment
• ON A PERSONNEL ASSIGNMENT PROBLEM
• scientific article; zbMATH DE number 553772 (Why is no real title available?)
• scientific article; zbMATH DE number 2000410 (Why is no real title available?)
• scientific article; zbMATH DE number 6600 (Why is no real title available?)
• scientific article; zbMATH DE number 1424460 (Why is no real title available?)
• On the complexity of the assignment problem with ordinal data
• Navy Personnel Planning and the Optimal Partition

This page was built for publication: A personnel assignment problem

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