### 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 |

### ASJC Scopus subject areas

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

## Fingerprint Dive into the research topics of 'A personnel assignment problem'. Together they form a unique fingerprint.

## Cite this

Ramanan, P., Deogun, J. S., & Liu, C. L. (1984). A personnel assignment problem.

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