### 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 language | English (US) |
---|---|

Pages (from-to) | 132-144 |

Number of pages | 13 |

Journal | Journal of Algorithms |

Volume | 5 |

Issue number | 1 |

DOIs | |

State | Published - Mar 1984 |

### Fingerprint

### ASJC Scopus subject areas

- Control and Optimization
- Computational Mathematics
- Computational Theory and Mathematics

### Cite this

*Journal of Algorithms*,

*5*(1), 132-144. https://doi.org/10.1016/0196-6774(84)90043-9

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

Research output: Contribution to journal › Article

*Journal of Algorithms*, vol. 5, no. 1, pp. 132-144. https://doi.org/10.1016/0196-6774(84)90043-9

}

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 -