Operations Research

5

Assignment Problem

5.1  INTRODUCTION

The assignment problem is one of the special type of transportation problem for which more efficient (less-time consuming) solution method has been devised by KUHN (1956) and FLOOD (1956). The justification of the steps leading to the solution is based on theorems proved by Hungarian mathematicians KONEIG (1950) and EGERVARY (1953), hence the method is named Hungarian.

5.2  GENERAL MODEL OF THE ASSIGNMENT PROBLEM

Consider n jobs and n persons. Assume that each job can be done only by one person and the time a person required for completing the i^th job (i = 1,2,...n) by the j^th person (j = 1,2,...n) is denoted by a real number C_ij. On the whole this model deals with the assignment of n candidates to n jobs ...