Dismiss
The InnovationQ application will be updated on Sunday, May 31st from 10am-noon ET. You may experience brief service interruptions during that time.
Browse Prior Art Database

Linear Assignment Algorithm

IP.com Disclosure Number: IPCOM000048955D
Original Publication Date: 1982-Apr-01
Included in the Prior Art Database: 2005-Feb-09

Publishing Venue

IBM

Related People

Authors:
Rutter, RS [+details]

Abstract

Introduction The linear assignment problem arises in several fields, e.g., computer physical design and operations research. A classic example is assigning jobs to men. Given a resource, men, a demand for that resource, jobs to be performed, and a rating of each man's performance on each job, find the set of job-man pairings which optimizes the overall performance. If the rating were in units of "hours to perform", the solution would be an assignment that minimized the total hours worked.