The assignment problem is a special case of transportation problem where the number of sources and destinations are equal.

**Assignment
Problem:**

**Introduction:**

The assignment problem
is a particular case 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 Method.

Suppose that we have â€˜*m*â€™
jobs to be performed on â€˜*n*â€™ machines . The cost of assigning each job to
each machine is *C _{ij}* (

The assignment problem
is a special case of transportation problem where the number of sources and
destinations are equal. Supply at each source and demand at each destination
must be one. It means that there is exactly one occupied cell in each row and
each column of the transportation table . Jobs represent sources and machines
represent destinations.

Tags : Introduction | Operations Research , 12th Business Maths and Statistics : Chapter 10 : Operations Research

Study Material, Lecturing Notes, Assignment, Reference, Wiki description explanation, brief detail

12th Business Maths and Statistics : Chapter 10 : Operations Research : Assignment Problem | Introduction | Operations Research

**Related Topics **

Privacy Policy, Terms and Conditions, DMCA Policy and Compliant

Copyright Â© 2018-2024 BrainKart.com; All Rights Reserved. Developed by Therithal info, Chennai.