The Assignment Problem: An Example

← Back to document page

The Assignment problem : An ExampleA company has 4 machines available for Assignment to 4 tasks. Any machine can be assignedto any task, and each task requires processing by one machine. The time required to set upeach machine for the processing of each task is given in the table (Hours)Task 1 Task 2 Task 3 Task 4Machine 113476Machine 211154Machine 36728Machine 41359The company wants to minimize the total setup time needed for the processing of all we think of the setup times as transportation costs and definexij= 1 if machineiis assigned to process taskj,0 if machineiis not assigned to process taskj,wherei= 1, 2, 3, 4 andj= 1, 2, 3, 4, then it is easily seen that what we have is a balancedtransportation problem with 4 sources (representing the machines), 4 sinks (representing thetasks)

The Assignment Problem: An Example A company has 4 machines available for assignment to 4 tasks. Any machine can be assigned to any task, and each task requires processing by one machine.

  Problem, Assignment, Assigned, Assignment problem