A personnel assignment problem

P. Ramanan, J. S. Deogun, C. L. Liu

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

The following personnel assignment problem is considered. Let (T, ≤) be a linearly ordered set where T is a set (of people), and let (P, ≤) be a partially ordered set where P, a set of positions of two types, is of the same cardinality as T. Each person i in T is to be assigned to a position. A feasible assignment of personnel to positions is an embedding of (P, ≤) in (T, ≤). Given measures of each person's effectiveness in both types of positions, an optimal assignment maximizes the total measure of effectiveness. The general assignment problem is shown to be NP-complete. O(n log n) algorithms for two special cases of the problem are presented.

Original languageEnglish (US)
Pages (from-to)132-144
Number of pages13
JournalJournal of Algorithms
Volume5
Issue number1
DOIs
StatePublished - Mar 1984

Fingerprint

Assignment Problem
Personnel
Person
Assignment
Ordered Set
Partially Ordered Set
Cardinality
NP-complete problem
Linearly
Maximise

ASJC Scopus subject areas

  • Control and Optimization
  • Computational Mathematics
  • Computational Theory and Mathematics

Cite this

A personnel assignment problem. / Ramanan, P.; Deogun, J. S.; Liu, C. L.

In: Journal of Algorithms, Vol. 5, No. 1, 03.1984, p. 132-144.

Research output: Contribution to journalArticle

Ramanan, P. ; Deogun, J. S. ; Liu, C. L. / A personnel assignment problem. In: Journal of Algorithms. 1984 ; Vol. 5, No. 1. pp. 132-144.
@article{9592444d188045db97f9493ac0f2ffe0,
title = "A personnel assignment problem",
abstract = "The following personnel assignment problem is considered. Let (T, ≤) be a linearly ordered set where T is a set (of people), and let (P, ≤) be a partially ordered set where P, a set of positions of two types, is of the same cardinality as T. Each person i in T is to be assigned to a position. A feasible assignment of personnel to positions is an embedding of (P, ≤) in (T, ≤). Given measures of each person's effectiveness in both types of positions, an optimal assignment maximizes the total measure of effectiveness. The general assignment problem is shown to be NP-complete. O(n log n) algorithms for two special cases of the problem are presented.",
author = "P. Ramanan and Deogun, {J. S.} and Liu, {C. L.}",
year = "1984",
month = "3",
doi = "10.1016/0196-6774(84)90043-9",
language = "English (US)",
volume = "5",
pages = "132--144",
journal = "Journal of Algorithms",
issn = "0196-6774",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - A personnel assignment problem

AU - Ramanan, P.

AU - Deogun, J. S.

AU - Liu, C. L.

PY - 1984/3

Y1 - 1984/3

N2 - The following personnel assignment problem is considered. Let (T, ≤) be a linearly ordered set where T is a set (of people), and let (P, ≤) be a partially ordered set where P, a set of positions of two types, is of the same cardinality as T. Each person i in T is to be assigned to a position. A feasible assignment of personnel to positions is an embedding of (P, ≤) in (T, ≤). Given measures of each person's effectiveness in both types of positions, an optimal assignment maximizes the total measure of effectiveness. The general assignment problem is shown to be NP-complete. O(n log n) algorithms for two special cases of the problem are presented.

AB - The following personnel assignment problem is considered. Let (T, ≤) be a linearly ordered set where T is a set (of people), and let (P, ≤) be a partially ordered set where P, a set of positions of two types, is of the same cardinality as T. Each person i in T is to be assigned to a position. A feasible assignment of personnel to positions is an embedding of (P, ≤) in (T, ≤). Given measures of each person's effectiveness in both types of positions, an optimal assignment maximizes the total measure of effectiveness. The general assignment problem is shown to be NP-complete. O(n log n) algorithms for two special cases of the problem are presented.

UR - http://www.scopus.com/inward/record.url?scp=30244550370&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=30244550370&partnerID=8YFLogxK

U2 - 10.1016/0196-6774(84)90043-9

DO - 10.1016/0196-6774(84)90043-9

M3 - Article

AN - SCOPUS:30244550370

VL - 5

SP - 132

EP - 144

JO - Journal of Algorithms

JF - Journal of Algorithms

SN - 0196-6774

IS - 1

ER -