Candidate to Job Allocation Problem with a Lexicographic Objective

J. Cramer and M. A. Pollatschek
Additional contact information
J. Cramer: Technion-Israel Institute of Technology
M. A. Pollatschek: Technion-Israel Institute of Technology

Management Science, 1979, vol. 25, issue 5, 466-473

Abstract: Allocation of candidates to jobs is required in a situation where each candidate can only be allocated to certain jobs, and every job's "length" decreases as more candidates are allocated to it. The objective is to minimize the "ranked length vector," which is derived by arranging the job-lengths in nonincreasing order, in the lexicographic sense. Necessary and sufficient conditions for optimality are derived, and an algorithm for obtaining optimal allocations is presented, along with computational experience.

Keywords: networks/graphs; programming: multiple criteria (search for similar items in EconPapers)
Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.25.5.466 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:25:y:1979:i:5:p:466-473

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().