Accession Number:

AD0648715

Title:

OPTIMAL ASSIGNMENTS IN AN ORDERED SET; AN APPLICATION OF MATROID THEORY

Descriptive Note:

Corporate Author:

CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER

Personal Author(s):

Report Date:

1967-02-01

Pagination or Media Count:

8.0

Abstract:

A certain set of jobs has been arranged in order of importance by some priority system and it is desired to fill the jobs from a pool of workers where each worker is qualified for some subset of the jobs. In general, it will not be possible to fill all of the jobs and the problem is therefore to choose the set of jobs to be filled in some optimal way. Roughly speaking, given all possible assignable sets of jobs one wishes to choose the one with highest priority. It is not clear, however, what this means as, for example, if the choice were between filling jobs 1, 4, 6 or 2, 3, 4, 5. The purpose of this note is to show that, in fact, there always does exist a best assignment.

Subject Categories:

  • Theoretical Mathematics
  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE