A personnel assignment problem

DOI10.1016/0196-6774(84)90043-9zbMath0541.68021OpenAlexW1983148611MaRDI QIDQ3327716

No author found.

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

algorithmsNP-completenesspartial orderlinear orderpersonnel assignment problem

Mathematics Subject Classification ID

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

Related Items (3)

Balloting Labelling and Personnel Assignment ⋮ A linear time algorithm for maximum matchings in convex, bipartite graphs ⋮ On the complexity of a family of generalized matching problems

This page was built for publication: A personnel assignment problem